Applying a condition for a Hamiltonian bipartite graph to be bipancyclic

DOI10.1016/0012-365X(93)90136-HzbMath0785.05058MaRDI QIDQ686432

Juan-Miguel Gracia

Publication date: 20 December 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

bipartite graphHamiltonian

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs ⋮ A sufficient condition for vertex bipancyclicity in balanced bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• New sufficient conditions for cycles in graphs
• Hamiltonian degree conditions which imply a graph is pancyclic
• A cycle structure theorem for Hamiltonian graphs
• On Hamilton's ideals
• On Hamiltonian bipartite graphs
• Bipartite graphs with cycles of all even lengths
• Some Theorems on Abstract Graphs

This page was built for publication: Applying a condition for a Hamiltonian bipartite graph to be bipancyclic