Characterizing degree-sum maximal nonhamiltonian bipartite graphs (Q658075)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Characterizing degree-sum maximal nonhamiltonian bipartite graphs |
scientific article |
Statements
Characterizing degree-sum maximal nonhamiltonian bipartite graphs (English)
0 references
11 January 2012
0 references
In 1963, \textit{J. Moon} and \textit{L. Moser} [Isr. J. Math. 1, 163--165 (1963; Zbl 0119.38806)] gave a bipartite analogue to Ore's famed theorem on hamiltonian graphs. While the sharpness examples of Ore's Theorem have been independently characterized in at least four different papers, no similar characterization exists for the Moon-Moser Theorem. In this note, we give such a characterization, consisting of one infinite family and two exceptional graphs of order eight, the latter being illustrated at Fig.~1. The list of references includes six works.
0 references
hamiltonian graphs
0 references
Ore's Theorem
0 references