Large sets of Hamilton cycle decompositions of complete bipartite graphs

DOI10.1016/j.ejc.2007.06.011zbMath1155.05040OpenAlexW2046459135MaRDI QIDQ932831

Hong-Tao Zhao, Qing-de Kang

Publication date: 11 July 2008

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2007.06.011

zbMATH Keywords

Hamilton cycle decompositionComplete bipartite graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

A novel approach for cyclic decompositions of balanced complete bipartite graphs into infinite graph classes ⋮ Large sets of Hamilton cycle and path decompositions of complete bipartite graphs ⋮ Large sets of almost Hamilton cycle and path decompositions of complete bipartite graphs ⋮ Large Sets of Wrapped K–K Hamilton Cycle Decompositions of Complete Bipartite 3‐Uniform Hypergraphs ⋮ Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs

Cites Work

• Hamiltonian decompositions of complete regular s-partite graphs
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle systems in the complete bipartite graph minus a one-factor
• Decompositions of complete multipartite graphs into cycles of even length
• Cycle decompositions III: Complete graphs and fixed length cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Large sets of Hamilton cycle decompositions of complete bipartite graphs