r-Regular, r-connected decompositions of complete graphs

DOI10.1002/(SICI)1520-6610(2000)8:1%3C15::AID-JCD3%3E3.0.CO;2-UMaRDI QIDQ4934836zbMATH OpenOpenAlexFDO

Authors W. R. Johnstone, Herbert Fleischner, A. J. W. Hilton

Publication date 30 January 2000

Full work available at URL https://doi.org/10.1002/(sici)1520-6610(2000)8:1%3C15::aid-jcd3%3E3.0.co;2-u

zbMATH Keywords

complete graphdecompositionsfactors

Mathematics Subject Classification ID

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

Recommendations

• Decompositions of Complete Graphs
• Some problems about \(r\)-factorizations of complete graphs
• A result on decompositions of regular graphs
• \(k\)-factors in regular graphs and edge-connectivity
• Almost regular edge colorings and regular decompositions of complete graphs

Cites work

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

Cited in

(6)

• Almost regular edge colorings and regular decompositions of complete graphs
• \(r\)-regular \(r\)-connected graphs with large girth
• Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations
• An algorithm for finding factorizations of complete graphs
• scientific article; zbMATH DE number 867634 (Why is no real title available?)
• Some problems about \(r\)-factorizations of complete graphs

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

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