Characterizing degree-sum maximal nonhamiltonian bipartite graphs

DOI10.1016/j.disc.2011.08.029zbMath1248.05108OpenAlexW2007579620MaRDI QIDQ658075

Michael Ferrara, Jeffrey Scott Powell, Michael S. Jacobson

Publication date: 11 January 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.08.029

zbMATH Keywords

hamiltonian graphsOre's Theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Related Items

Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles, Distance signless Laplacian spectral radius and Hamiltonian properties of graphs, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Panconnectivity in bipartite graphs with large degree sum, Unnamed Item, On Hamiltonian cycles in balanced \(k\)-partite graphs, Spectral radius and Hamiltonicity of graphs, New sufficient conditions for bipancyclicity of balanced bipartite digraphs, Spanning bipartite graphs with high degree sum in graphs, Spanning bipartite graphs with large degree sum in graphs of odd order, A degree sum condition for the existence of an \(S\)-path-system in a bipartite graph

Cites Work

• On Hamiltonian bipartite graphs
• Note on Hamilton Circuits
• Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item