Characterizing degree-sum maximal nonhamiltonian bipartite graphs
From MaRDI portal
(Redirected from Publication:658075)
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; zbMATH DE number 140141
- Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
Cites work
- scientific article; zbMATH DE number 5901724 (Why is no real title available?)
- scientific article; zbMATH DE number 3924825 (Why is no real title available?)
- scientific article; zbMATH DE number 3733974 (Why is no real title available?)
- Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees
- Note on Hamilton Circuits
- On Hamiltonian bipartite graphs
Cited in
(12)- Panconnectivity in bipartite graphs with large degree sum
- 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
- scientific article; zbMATH DE number 7771746 (Why is no real title available?)
- New sufficient conditions for bipancyclicity of balanced bipartite digraphs
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Distance signless Laplacian spectral radius and Hamiltonian properties of graphs
- Spanning bipartite graphs with large degree sum in graphs of odd order
- Spanning bipartite graphs with high degree sum in graphs
- Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
- On Hamiltonian cycles in balanced \(k\)-partite graphs
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)