Amalgamations of factorizations of complete equipartite graphs

DOI10.1016/J.DISC.2003.11.030zbMath1057.05065OpenAlexW2028104895WikidataQ114190816 ScholiaQ114190816MaRDI QIDQ1876684

Matthew Johnson, Anthony J. W. Hilton

Publication date: 20 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.030

zbMATH Keywords

factorizationcomplete equipartite graphamalgamation method

Mathematics Subject Classification ID

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

Cites Work

• Hamiltonian decompositions of complete graphs
• Hamiltonian decompositions of complete regular s-partite graphs
• Amalgamations of almost regular edge-colourings of simple graphs
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• Amalgamations of connected \(k\)-factorizations.
• Connected Detachments of Graphs and Generalized Euler Trails
• Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of k_kn+1
• An algorithm for finding factorizations of complete graphs
• Decompositions of Complete Graphs

This page was built for publication: Amalgamations of factorizations of complete equipartite graphs