Large sets of Hamilton cycle and path decompositions of complete bipartite graphs

DOI10.1007/s00373-011-1088-0zbMath1258.05065OpenAlexW2098273068MaRDI QIDQ1938890

Hong-Tao Zhao, Qing-de Kang

Publication date: 25 February 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1088-0

zbMATH Keywords

decompositionHamilton pathlarge setHamilton cyclecomplete automorphism group

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Large sets of almost Hamilton cycle and path decompositions of complete bipartite graphs ⋮ Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On large sets of disjoint Steiner triple systems. IV
• Large sets of Hamilton cycle decompositions of complete bipartite graphs
• Large sets of Hamilton cycle and path decompositions
• On large sets of disjoint Steiner triple systems. III
• A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
• A completion of the spectrum for large sets of disjoint transitive triple systems
• \(\widehat C_k\)-factorization of symmetric complete bipartite and tripartite multi-digraphs
• On large sets of almost Hamilton cycle decompositions
• The spectrum for large sets of disjoint mendelsohn triple systems with any index

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