Sequentially perfect and uniform one-factorizations of the complete graph

MaRDI QIDQ1773191zbMATH OpenFDO

Authors J. H. Dinitz, D. R. Stinson, Peter 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, http://www.emis.de/journals/EJC/Volume_12/Abstracts/v12i1r1.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

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

Recommendations

• On perfect one-factorization of the complete graph \(K_{2p}\)
• Some new perfect one-factorizations from starters in finite fields
• scientific article; zbMATH DE number 1934391
• scientific article; zbMATH DE number 4118407
• scientific article; zbMATH DE number 4070947

Cited in

(6)

• scientific article; zbMATH DE number 812037 (Why is no real title available?)
• Primitive one-factorizations and the geometry of mixed translations
• On strong Skolem starters for \(\mathbb{Z}_{pq} \)
• A note on two orthogonal totally \(C_4\)-free one-factorizations of complete graphs
• Two orthogonal 4-cycle-free one-factorizations of complete graphs
• On the structure of uniform one-factorizations from starters in finite fields

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1773191)