Skip to main content
Log in

On Hamiltonian bipartite graphs

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Dirac, G.A., 1952, Some theorems on abstract graphs,Proc. London Math. Soc.,2, 69–87.

    Article  MathSciNet  Google Scholar 

  2. Erdös, P. and Gallai, T., 1959, On maximal paths and circuits of graphs,Acta Math. Acad. Sci. Hung.,10, 337–356.

    Article  MATH  Google Scholar 

  3. Erdös, P., 1962, Remarks on a paper of Pósa,Publ. Math. Inst. Hung. Acad. Sci.,7, 227–228.

    MATH  Google Scholar 

  4. Newman, D. J., 1958, A problem in graph theory,Amer. Math. Monthly,65, 677.

    Google Scholar 

  5. Ore, O., 1960, Note on Hamilton circuits,Amer. Math. Monthly,67, 55.

    Article  MathSciNet  Google Scholar 

  6. Ore, O., 1961, Arc coverings of graphs,Ann. Mat. Pura Appl.,55, 315–321.

    Article  MATH  MathSciNet  Google Scholar 

  7. Pósa, L., 1962, A theorem concerning Hamilton lines,Publ. Math. Inst. Hung. Acad. Sci.,7, 225–226.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02759704

Keywords

Navigation