New sufficient conditions for bipancyclic bipartite graphs

DOI10.1016/J.DISC.2003.11.039MaRDI QIDQ1883243zbMATHOpenAlexFDO

Authors Mohamed El Kadi Abderrezzak, Evelyne Flandrin

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

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

Recommendations

• A sufficient condition for vertex bipancyclicity in balanced bipartite graphs
• A condition for a Hamiltonian bipartite graph to be bipancyclic
• scientific article; zbMATH DE number 1071797
• On Ore-type sufficient condition for a bipancyclic ordering
• scientific article; zbMATH DE number 140141

Cites work

• scientific article; zbMATH DE number 3902696 (Why is no real title available?)
• scientific article; zbMATH DE number 19220 (Why is no real title available?)
• A method in graph theory
• Biclosure and bistability in a balanced bipartite graph
• Bipartite graphs with cycles of all even lengths
• Graph theory
• Hamiltonian properties and the bipartite independence number
• Note on Hamilton Circuits
• On Hamiltonian bipartite graphs
• Pancyclic graphs. I
• Pancyclism and small cycles in graphs
• The complete closure of a graph

Cited in

(12)

• Uniquely Bipancyclic Graphs on Thirty-two Vertices
• Transversals and bipancyclicity in bipartite graph families
• scientific article; zbMATH DE number 2094763 (Why is no real title available?)
• A sufficient condition for vertex bipancyclicity in balanced bipartite graphs
• Edge condition for a Hamiltonian bipartite graph to be bipancyclic
• scientific article; zbMATH DE number 140141 (Why is no real title available?)
• An optimal binding number condition for bipancyclism
• Conditions for a bigraph to be super-cyclic
• New sufficient conditions for cycles in graphs
• Sufficient conditions for a balanced bipartite digraph to be even pancyclic
• A condition for a Hamiltonian bipartite graph to be bipancyclic
• Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1883243)