Abstract
Various sufficient conditions for the existence of Hamiltonian circuits in ordinary graphs are known. In this paper the analogous results for bipartite graphs are obtained.
Similar content being viewed by others
References
Dirac, G.A., 1952, Some theorems on abstract graphs,Proc. London Math. Soc.,2, 69–87.
Erdös, P. and Gallai, T., 1959, On maximal paths and circuits of graphs,Acta Math. Acad. Sci. Hung.,10, 337–356.
Erdös, P., 1962, Remarks on a paper of Pósa,Publ. Math. Inst. Hung. Acad. Sci.,7, 227–228.
Newman, D. J., 1958, A problem in graph theory,Amer. Math. Monthly,65, 677.
Ore, O., 1960, Note on Hamilton circuits,Amer. Math. Monthly,67, 55.
Ore, O., 1961, Arc coverings of graphs,Ann. Mat. Pura Appl.,55, 315–321.
Pósa, L., 1962, A theorem concerning Hamilton lines,Publ. Math. Inst. Hung. Acad. Sci.,7, 225–226.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Moon, J., Moser, L. On Hamiltonian bipartite graphs. Israel J. Math. 1, 163–165 (1963). https://doi.org/10.1007/BF02759704
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02759704