A sufficient condition for Hamiltonians in balanced bipartite graphs
From MaRDI portal
Publication:2992099
Recommendations
- scientific article; zbMATH DE number 786226
- scientific article; zbMATH DE number 3847429
- Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs
- Sufficient conditions for Hamiltonian cycles in bipartite digraphs
- A sufficient condition for a balanced bipartite digraph to be Hamiltonian
Cited in
(11)- The Hamiltonicity of bipartite graphs involving neighborhood unions
- A necessary and sufficient condition for a bipartite distance-hereditary graph to be Hamiltonian
- scientific article; zbMATH DE number 7225861 (Why is no real title available?)
- Bipartite graphs with every \(k\)-matching in a Hamiltonian cycle.
- Edge condition for Hamiltonicity in balanced tripartite graphs
- scientific article; zbMATH DE number 1766895 (Why is no real title available?)
- Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs
- On the bipartite independence number of a balanced bipartite graph
- Binding number, minimum degree and bipancyclism in bipartite graphs
- scientific article; zbMATH DE number 786226 (Why is no real title available?)
- scientific article; zbMATH DE number 3847429 (Why is no real title available?)
This page was built for publication: A sufficient condition for Hamiltonians in balanced bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2992099)
