Pages that link to "Item:Q2352638"
From MaRDI portal
The following pages link to On the number of 1-factorizations of a complete graph (Q2352638):
Displaying 20 items.
- Switching in one-factorisations of complete graphs (Q405262) (← links)
- A generalization of Tutte's 1-factor theorem to countable graphs (Q800941) (← links)
- Computer generation of all 1-factors for a class of graphs with all vertices of degree two or three (Q1061146) (← links)
- On 1-factorizability of Cayley graphs (Q1068102) (← links)
- Non-full-rank Steiner quadruple systems \(S(v,4,3)\) (Q2263010) (← links)
- Unextendible product bases and 1-factorization of complete graphs (Q2492195) (← links)
- Some new results on 1-rotational 2-factorizations of the complete graph (Q3057071) (← links)
- On the number of (<i>r,r</i>+1)- factors in an (<i>r,r</i>+1)-factorization of a simple graph (Q3633008) (← links)
- (Q3679236) (← links)
- One-factorizations of the complete graph—A survey (Q3714114) (← links)
- On the size of graphs with complete-factors (Q3722537) (← links)
- (Q3791183) (← links)
- On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups (Q3803151) (← links)
- (Q4026155) (← links)
- (Q4604108) (← links)
- (Q4794061) (← links)
- (Q4853711) (← links)
- (Q4901058) (← links)
- 1‐Factorizations of pseudorandom graphs (Q5136914) (← links)
- Optimal patrolling strategies for trees and complete networks (Q6096604) (← links)
