r-Regular, r-connected decompositions of complete graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6610(2000)8:1<15::AID-JCD3>3.0.CO;2-U" /><15::AID-JCD3>3.0.CO;2-U 10.1002/(SICI)1520-6610(2000)8:1<15::AID-JCD3>3.0.CO;2-UzbMath0942.05054OpenAlexW1985452783MaRDI QIDQ4934836

W. R. Johnstone, Anthony J. W. Hilton, Herbert Fleischner

Publication date: 30 January 2000

Full work available at URL: https://doi.org/10.1002/(sici)1520-6610(2000)8:1<15::aid-jcd3>3.0.co;2-u

zbMATH Keywords

decompositionscomplete graphfactors

Mathematics Subject Classification ID

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

Cites Work

• Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
• Factorizations of regular graphs of high degree
• Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of k_kn+1

This page was built for publication: r-Regular, r-connected decompositions of complete graphs