Applying a condition for a Hamiltonian bipartite graph to be bipancyclic
From MaRDI portal
(Redirected from Publication:686432)
Recommendations
- A condition for a Hamiltonian bipartite graph to be bipancyclic
- Edge condition for a Hamiltonian bipartite graph to be bipancyclic
- Sufficient conditions for Hamiltonian cycles in bipartite digraphs
- scientific article; zbMATH DE number 11998
- scientific article; zbMATH DE number 3847429
- A sufficient condition for pancyclism of Hamiltonian graphs
- A sufficient condition for a balanced bipartite digraph to be Hamiltonian
- Hamiltonian cycles in bipartite graphs
- On the Meyniel condition for Hamiltonicity in bipartite digraphs
- On Hamiltonian bipartite graphs
Cites work
- scientific article; zbMATH DE number 3630799 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- A cycle structure theorem for Hamiltonian graphs
- Bipartite graphs with cycles of all even lengths
- Hamiltonian degree conditions which imply a graph is pancyclic
- New sufficient conditions for cycles in graphs
- On Hamilton's ideals
- On Hamiltonian bipartite graphs
- Some Theorems on Abstract Graphs
Cited in
(4)- A necessary and sufficient condition for a bipartite distance-hereditary graph to be Hamiltonian
- A sufficient condition for vertex bipancyclicity in balanced bipartite graphs
- Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs
- Bipartite graphs with balanced \((a,b)\)-partitions
This page was built for publication: Applying a condition for a Hamiltonian bipartite graph to be bipancyclic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686432)
