Large sets of Hamilton cycle decompositions of complete bipartite graphs

Authors:
Qingde Kang;Hongtao Zhao
Affiliations:
Institute of Mathematics, Hebei Normal University, Shijiazhuang 050016, China;School of Mathematics and Physics, North China Electric Power University, Beijing 102206, China
Venue:
European Journal of Combinatorics
Year:
2008

Citing 3
Cited 0

Hamiltonian decompositions of complete regular s-partite graphs

Discrete Mathematics
A completion of Lu's determination of the spectrum of large sets of disjoint Steiner Triple systems

Journal of Combinatorial Theory Series A
Cycle decomposition of Kn and Kn-1

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let K"2"t"+"1","2"t"+"1-I denote the complete bipartite graph K"2"t"+"1","2"t"+"1 minus a 1-factor. In this paper, we prove that there exist a large set of Hamilton cycle decomposition of K"2"t","2"t and a large set of Hamilton cycle decomposition of K"2"t"+"1","2"t"+"1-I.