\(k\)-cycle free one-factorizations of complete graphs

zbMath1178.05077MaRDI QIDQ1010904

Mariusz Meszka

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/117289

zbMATH Keywords

complete graphone-factorization

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

Switching in one-factorisations of complete graphs ⋮ Unifying some known infinite families of combinatorial 3-designs ⋮ Optimal ternary constant-composition codes with weight four and distance three ⋮ Two orthogonal 4-cycle-free one-factorizations of complete graphs ⋮ A note on two orthogonal totally \(C_4\)-free one-factorizations of complete graphs ⋮ On strong Skolem starters for ℤ_pq ⋮ On \((1,C_4)\) one-factorization and two orthogonal \((2,C_4)\) one-factorizations of complete graphs

This page was built for publication: \(k\)-cycle free one-factorizations of complete graphs