Minimal defining sets of 1-factorizations of complete graphs

MaRDI QIDQ3534282zbMATH OpenFDO

Authors Nicholas J. Cavenagh, Diane Donovan, Abdollah Khodkar

Publication date 3 November 2008

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 6843209
• On the defining number of \(K_{2n}\;1\)-factors
• Publication:4488576
• On perfect one-factorization of the complete graph \(K_{2p}\)
• On \((1,C_4)\) one-factorization and two orthogonal \((2,C_4)\) one-factorizations of complete graphs

This page was built for publication: Minimal defining sets of 1-factorizations of complete graphs

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