Pages that link to "Item:Q1010904"
From MaRDI portal
The following pages link to \(k\)-cycle free one-factorizations of complete graphs (Q1010904):
Displaying 7 items.
- Switching in one-factorisations of complete graphs (Q405262) (← links)
- Optimal ternary constant-composition codes with weight four and distance three (Q1727782) (← links)
- Two orthogonal 4-cycle-free one-factorizations of complete graphs (Q1741579) (← links)
- A note on two orthogonal totally \(C_4\)-free one-factorizations of complete graphs (Q2024050) (← links)
- On \((1,C_4)\) one-factorization and two orthogonal \((2,C_4)\) one-factorizations of complete graphs (Q2062904) (← links)
- Unifying some known infinite families of combinatorial 3-designs (Q2431267) (← links)
- On strong Skolem starters for ℤ<sub><i>pq</i></sub> (Q4956211) (← links)
