Pages that link to "Item:Q1212021"

The following pages link to On the number of 1-factorizations of the complete graph (Q1212021):

Displaying 17 items.

• Switching in one-factorisations of complete graphs (Q405262) (← links)
• Classification of Steiner quadruple systems of order 16 and rank 14 (Q415672) (← links)
• Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
• Premature sets of 1-factors or how not to schedule round robin tournaments (Q1051003) (← links)
• Construction of Steiner quadruple systems having a prescribed number of blocks in common (Q1147152) (← links)
• On a class of completable partial edge-colourings (Q1186316) (← links)
• Steiner quadruple systems all of whose derived Steiner triple systems are nonisomorphic (Q1227624) (← links)
• Steiner quadruple systems - a survey (Q1254321) (← links)
• One-factorisations of complete graphs arising from ovals in finite planes (Q1671774) (← links)
• Subdesigns in Steiner quadruple systems (Q2277459) (← links)
• One-factorisations of complete graphs constructed in Desarguesian planes of certain odd square orders (Q2294105) (← links)
• On Nonisomorphic Room Squares (Q3037455) (← links)
• Cryptosystems involving one-factorizations of graphs (Q3574297) (← links)
• On Disjoint Partial Quadruple Systems having Seventeen Blocks (Q3731614) (← links)
• On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups (Q3803151) (← links)
• Coloring Steiner Triple Systems (Q3966168) (← links)
• There are 526,915,620 nonisomorphic one‐factorizations of K₁₂ (Q4764660) (← links)