An algorithm for finding factorizations of complete graphs

DOI10.1002/JGT.10109MaRDI QIDQ4406068zbMATH OpenOpenAlexWikidataFDO

Authors Matthew Johnson, A. J. W. Hilton

Publication date 25 June 2003

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.10109

zbMATH Keywords

algorithmfactorizationcomplete graphregular factor

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Factorisation of the complete graph into spanning regular factors
• Almost‐regular factorization of graphs
• Decompositions of Complete Graphs
• Almost regular edge colorings and regular decompositions of complete graphs
• r-Regular, r-connected decompositions of complete graphs

Cited in

(11)

• Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations
• Edge decompositions and rooted packings of graphs
• Computer generation of all 1-factors for a class of graphs with all vertices of degree two or three
• Amalgamations of factorizations of complete equipartite graphs
• A Lagrangian approach for minimum cost single round robin tournaments
• Amalgamations of factorizations of complete graphs
• Factor-graphs and automorphism
• scientific article; zbMATH DE number 5155854 (Why is no real title available?)
• scientific article; zbMATH DE number 2108132 (Why is no real title available?)
• An algorithm for computing simple \(k\)-factors
• Factorisation of the complete graph into spanning regular factors

This page was built for publication: An algorithm for finding factorizations of complete graphs

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