Characterizing degree-sum maximal nonhamiltonian bipartite graphs
DOI10.1016/J.DISC.2011.08.029zbMATH Open1248.05108OpenAlexW2007579620MaRDI QIDQ658075FDOQ658075
Authors: Michael Ferrara, Michael Jacobson, Jeffrey Powell 
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
Recommendations
- Spanning bipartite graphs with high degree sum in graphs
- Spanning bipartite graphs with large degree sum in graphs of odd order
- Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
- scientific article
- Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)
Cites Work
Cited In (11)
- A degree sum condition for the existence of an \(S\)-path-system in a bipartite graph
- Spectral radius and Hamiltonicity of graphs
- Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
- Title not available (Why is that?)
- New sufficient conditions for bipancyclicity of balanced bipartite digraphs
- Distance signless Laplacian spectral radius and Hamiltonian properties of graphs
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Spanning bipartite graphs with large degree sum in graphs of odd order
- Spanning bipartite graphs with high degree sum in graphs
- On Hamiltonian cycles in balanced \(k\)-partite graphs
- Panconnectivity in bipartite graphs with large degree sum
This page was built for publication: Characterizing degree-sum maximal nonhamiltonian bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658075)
