Pages that link to "Item:Q1051003"
From MaRDI portal
The following pages link to Premature sets of 1-factors or how not to schedule round robin tournaments (Q1051003):
Displayed 9 items.
- Embedding partial Steiner triple systems is NP-complete (Q787671) (← links)
- On the intricacy of combinatorial construction problems (Q799678) (← 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)
- Round robin scheduling -- a survey (Q2475809) (← links)
- Sports tournaments, home-away assignments, and the break minimization problem (Q2506823) (← links)