Sequentially perfect and uniform one-factorizations of the complete graph

zbMath1068.05055MaRDI QIDQ1773191

Jeffrey H. Dinitz, Douglas R. Stinson, Peter J. Dukes

Publication date: 25 April 2005

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

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

Mathematics Subject Classification ID

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

Related Items (5)

Two orthogonal 4-cycle-free one-factorizations of complete graphs ⋮ Primitive one-factorizations and the geometry of mixed translations ⋮ On the structure of uniform one-factorizations from starters in finite fields ⋮ A note on two orthogonal totally \(C_4\)-free one-factorizations of complete graphs ⋮ On strong Skolem starters for ℤ_pq

This page was built for publication: Sequentially perfect and uniform one-factorizations of the complete graph