Pages that link to "Item:Q3714114"

The following pages link to One-factorizations of the complete graph—A survey (Q3714114):

Displaying 29 items.

• On circular--linear one-factorizations of the complete graph (Q2329207) (← links)
• Loops, regular permutation sets and colourings of directed graphs. (Q2352469) (← links)
• Construction of a class of loops via graphs. (Q2380490) (← links)
• Resolvability of infinite designs (Q2434885) (← links)
• Round robin scheduling -- a survey (Q2475809) (← links)
• On the structure of uniform one-factorizations from starters in finite fields (Q2490141) (← links)
• Unextendible product bases and 1-factorization of complete graphs (Q2492195) (← links)
• Scheduling the Italian football league: an ILP-based approach (Q2583776) (← links)
• Perfect one-factorizations arising from the Lee metric (Q2680575) (← links)
• On the intersection problem for 1-factorizations and near 1-factorizations of \(K_v\) (Q2770446) (← links)
• One-factorizations of complete graphs with vertex-regular automorphism groups (Q2782293) (← links)
• A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room Squares (Q3029017) (← links)
• (Q3369849) (← links)
• One–factorizations of complete graphs with regular automorphism groups (Q3439435) (← links)
• Perfect 1-Factorizations of a Family of Cayley Graphs (Q3465907) (← links)
• Cryptosystems involving one-factorizations of graphs (Q3574297) (← links)
• Rainbow and orthogonal paths in factorizations of<i>K</i><i>n</i> (Q3576975) (← links)
• The Existence of a Subsquare Free Latin Square of Side 12 (Q3749064) (← links)
• On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups (Q3803151) (← links)
• (Q4026155) (← links)
• (Q4243216) (← links)
• One-Factorizations of Complete Graphs with a Doubly Transitive Automorphism Group (Q4294043) (← links)
• (Q4604108) (← links)
• (Q4853711) (← links)
• A Dirac Type Condition for Properly Coloured Paths and Cycles (Q5418769) (← links)
• On the convergence of the mild random walk algorithm to generate random one-factorizations of complete graphs (Q5865698) (← links)
• Construction of orthogonal starters and corollaries (Q5905633) (← links)
• Abelian 1-factorizations of the complete graph (Q5937421) (← links)
• There are 3155 nonisomorphic perfect one‐factorizations of <i>K</i>₁₆ (Q6185551) (← links)