Applying a condition for a Hamiltonian bipartite graph to be bipancyclic
From MaRDI portal
Publication:686432
DOI10.1016/0012-365X(93)90136-HzbMATH Open0785.05058MaRDI QIDQ686432FDOQ686432
Authors: Juan-Miguel Gracia 
Publication date: 20 December 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
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
- On Hamilton's ideals
- Some Theorems on Abstract Graphs
- New sufficient conditions for cycles in graphs
- Title not available (Why is that?)
- On Hamiltonian bipartite graphs
- A cycle structure theorem for Hamiltonian graphs
- Title not available (Why is that?)
- Hamiltonian degree conditions which imply a graph is pancyclic
- Bipartite graphs with cycles of all even lengths
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)
