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

DOI10.1007/s00373-014-1513-2zbMath1328.05024OpenAlexW2095456220MaRDI QIDQ897300

Hong-Tao Zhao, Qing-de Kang

Publication date: 17 December 2015

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

Full work available at URL: https://doi.org/10.1007/s00373-014-1513-2

zbMATH Keywords

decompositionlarge setalmost Hamilton cyclealmost Hamilton pathcomplete automorphism group

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

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
• Large sets of Hamilton cycle and path decompositions of complete bipartite graphs
• On large sets of almost Hamilton cycle decompositions
• Large set of P₃‐decompositions
• On large sets ofPk-decompositions

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