On Hamiltonian bipartite graphs

On Hamiltonian bipartite graphs
复制标题

DOI:
10.1007/bf02759704
复制
发表时间:
1963-09
影响因子:
1
通讯作者:
J. Moon;L. Moser
J. Moon;L. Moser
中科院分区:
数学2区
文献类型:
--
作者:
J. Moon;L. Moser

文献摘要

被引文献

相似文献

普通图中哈密顿回路存在的各种充分条件是已知的。本文得到了二部图的类似结果。Dirac、Erd6s、Ore、P6sa 等人已经给出了普通图(无环或多边)为哈密顿量的各种充分条件。本文的目的是指出二分图的一些相应结果,这些结果可以通过类似的方法获得。
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.Various sufficient conditions for an ordinary graph (without loops or multiple edges) to be Hamiltonian have been given by Dirac, Erd6s, Ore, P6sa, and others. The object of this note is to point out some corresponding results for bipartite graphs which can be obtained by similar methods.