A sufficient condition for vertex bipancyclicity in balanced bipartite graphs
From MaRDI portal
(Redirected from Publication:6172209)
Recommendations
- Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs
- New sufficient conditions for bipancyclic bipartite graphs
- scientific article; zbMATH DE number 1190978
- scientific article; zbMATH DE number 638674
- Binding number, minimum degree and bipancyclism in bipartite graphs
Cites work
- An efficient condition for a graph to be Hamiltonian
- Applying a condition for a Hamiltonian bipartite graph to be bipancyclic
- Bipartite graphs with every k-matching in a Hamiltonian cycle.
- Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs
- Graph theory
- scientific article; zbMATH DE number 1289752 (Why is no real title available?)
- New sufficient conditions for cycles in graphs
- Note on Hamilton Circuits
- On Hamiltonian bipartite graphs
Cited in
(14)- On the bipartite independence number of a balanced bipartite graph
- New sufficient conditions for bipancyclic bipartite graphs
- Panconnectivity in bipartite graphs with large degree sum
- scientific article; zbMATH DE number 6692111 (Why is no real title available?)
- A necessary and sufficient eigenvector condition for a connected graph to be bipartite
- scientific article; zbMATH DE number 1190978 (Why is no real title available?)
- scientific article; zbMATH DE number 140141 (Why is no real title available?)
- scientific article; zbMATH DE number 638674 (Why is no real title available?)
- scientific article; zbMATH DE number 1071797 (Why is no real title available?)
- scientific article; zbMATH DE number 2094763 (Why is no real title available?)
- Binding number, minimum degree and bipancyclism in bipartite graphs
- Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs
- Vertex-bipancyclicity in a bipartite graph collection
- Chorded bipancyclicity for degree-sum conditions of two vertices with distance two in balanced bipartite graphs
This page was built for publication: A sufficient condition for vertex bipancyclicity in balanced bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6172209)