Abstract
A k-regular bipartite graph is said to be 2-factor hamiltonian if each of its 2-factor is hamiltonian. It is well known that if a k-regular bipartite graph is 2-factor hamiltonian, then k≦3. In this paper, we give a new proof of this fact.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Abreu, D. Labbate and J. Sheehan, Pseudo and strongly pseudo 2-factor isomorphic regular graphs, preprint, http://arxiv.org/abs/1002.1033.
R. E. L. Aldred, M. Funk, B. Jackson, D. Labbate and J. Sheehan, Regular bipartite graphs with all 2-factors isomorphic, J. Combin. Theory Ser. B, 92 (2004), 151–161.
P. J. Cameron, Permutation Groups, London Mathematical Society Student Texts 45 (1999).
M. Funk, B. Jackson, D. Labbate and J. Sheehan, 2-factor hamiltonian graphs, J. Combin. Theory Ser. B, 87 (2003), 138–144.
P. Hall, On representatives of subsets, J. London Math. Soc., 10 (1935), 26–30.
D. König, Über Graphen und ihre Andwendung auf Determinantentheorie und Mengenlehre, Math. Ann., 77 (1916), 453–465.
D. König, Graphs and their application in the theory of determinants and sets, Math. Termész. Ért., 34 (1916), 104–119 (in Hungarian).
W. McCuaig, Even dicycles, J. Graph Theory, 35 (2000), 46–68.
Author information
Authors and Affiliations
Corresponding author
Additional information
Corresponding author.
Rights and permissions
About this article
Cite this article
Ku, C.Y., Wong, K.B. On 2-factor hamiltonian regular bipartite graphs. Acta Math Hung 138, 173–178 (2013). https://doi.org/10.1007/s10474-012-0272-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10474-012-0272-x