Pages that link to "Item:Q1051003"

The following pages link to Premature sets of 1-factors or how not to schedule round robin tournaments (Q1051003):

Displaying 15 items.

• Embedding partial Steiner triple systems is NP-complete (Q787671) (← links)
• On the intricacy of combinatorial construction problems (Q799678) (← links)
• An application of Tutte's theorem to 1-factorization of regular graphs of high degree (Q1044942) (← links)
• The edge-chromatic class of regular graphs of degree 4 and their complements (Q1087882) (← links)
• Repeated blocks in indecomposable twofold triple systems (Q1109035) (← links)
• The spectrum of maximal sets of one-factors (Q1184003) (← links)
• A polynomial-time algorithm to find an equitable home--away assignment (Q1779696) (← links)
• Equitable embeddings of Steiner triple systems (Q1906137) (← links)
• Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021 (Q2163749) (← links)
• On circular--linear one-factorizations of the complete graph (Q2329207) (← links)
• Round robin scheduling -- a survey (Q2475809) (← links)
• Sports tournaments, home-away assignments, and the break minimization problem (Q2506823) (← links)
• A greedy algorithm for the social golfer and the Oberwolfach problem (Q2670589) (← links)
• A tutorial on graph models for scheduling round‐robin sports tournaments (Q6056890) (← links)
• There are 3155 nonisomorphic perfect one‐factorizations of <i>K</i>₁₆ (Q6185551) (← links)