A condition for a Hamiltonian bipartite graph to be bipancyclic

DOI10.1016/0012-365X(92)90116-WzbMath0764.05048MaRDI QIDQ1193443

S. Singh

Publication date: 27 September 1992

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

zbMATH Keywords

Hamiltonian cycleHamiltonian bipartite graphbipancyclic

Mathematics Subject Classification ID

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

Related Items (1)

Uniquely Bipancyclic Graphs on Thirty-two Vertices

Cites Work

• Unnamed Item
• New sufficient conditions for cycles in graphs
• Pancyclism in hamiltonian graphs
• A cycle structure theorem for Hamiltonian graphs
• The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
• Pancyclic graphs and a conjecture of Bondy and Chvatal
• Pancyclic graphs. I
• On Hamilton's ideals
• On Hamiltonian bipartite graphs
• Note on Hamilton Circuits
• Bipartite graphs with cycles of all even lengths
• Some Theorems on Abstract Graphs

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