New sufficient conditions for bipancyclic bipartite graphs

DOI10.1016/J.DISC.2003.11.039zbMath1048.05051OpenAlexW2026708846MaRDI QIDQ1883243

Evelyne Flandrin, Mohamed El Kadi Abderrezzak

Publication date: 1 October 2004

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

Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.039

zbMATH Keywords

Hamiltonian path

Mathematics Subject Classification ID

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

Related Items (2)

Uniquely Bipancyclic Graphs on Thirty-two Vertices ⋮ Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A method in graph theory
• Hamiltonian properties and the bipartite independence number
• Pancyclic graphs. I
• On Hamiltonian bipartite graphs
• Pancyclism and small cycles in graphs
• The complete closure of a graph
• Note on Hamilton Circuits
• Bipartite graphs with cycles of all even lengths
• Biclosure and bistability in a balanced bipartite graph

This page was built for publication: New sufficient conditions for bipancyclic bipartite graphs