Abstract
We give a sufficient condition for bipartite graphs to be Hamiltonian. The condition involves the edge-density and balanced independence number of a bipartite graph.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Beck: Random graphs and positional games on the complete graph,Annals of Discrete Math. 28 (1983), 7–14.
J. Beck: Remarks on positional games,Acta Math. Acad. Sci. Hungar. 40 (1–2) (1982), 65–71.
J. Beck, andL. Csirmaz: Variations on a game,J. of Combinatorial Theory A 33 (1982), 297–315.
J. Beck: Van Der Waerden and Ramsey Type Games,Combinatorica 1 (1981), 103–116.
J. A. Bondy, andU. S. R. Murty:Graph Theory with Applications, North-Holland, 1976.
P. Erdős, andJ. Selfridge: On combinatorial Game,J. Combinatorial Theory Ser. A 14 (1973), 298–301.
X. Lu: Hamiltonian games,J. Combinatorial Theory B 55 (1992), 18–32.
X. Lu: Hamiltonian cycles and games of graphs, Thesis, 1992, Rutgers University, and Dimacs Technical Report 92-136.
X. Lu: A sufficient condition for bipartite graphs to be hamiltonian, submitted.
X. Lu: Hamiltonian games on the complete bipartite graphK n,n , to appear inDiscrete Math.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lu, X. Hamiltonian cycles in bipartite graphs. Combinatorica 15, 247–254 (1995). https://doi.org/10.1007/BF01200758
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01200758