New sufficient conditions for bipancyclic bipartite graphs
From MaRDI portal
Publication:1883243
DOI10.1016/J.DISC.2003.11.039zbMATH Open1048.05051OpenAlexW2026708846MaRDI QIDQ1883243FDOQ1883243
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
Recommendations
Cites Work
- Graph theory
- Pancyclic graphs. I
- Note on Hamilton Circuits
- A method in graph theory
- On Hamiltonian bipartite graphs
- Pancyclism and small cycles in graphs
- Title not available (Why is that?)
- Bipartite graphs with cycles of all even lengths
- Title not available (Why is that?)
- Hamiltonian properties and the bipartite independence number
- The complete closure of a graph
- Biclosure and bistability in a balanced bipartite graph
Cited In (12)
- Conditions for a bigraph to be super-cyclic
- A condition for a Hamiltonian bipartite graph to be bipancyclic
- Edge condition for a Hamiltonian bipartite graph to be bipancyclic
- New sufficient conditions for cycles in graphs
- An optimal binding number condition for bipancyclism
- Title not available (Why is that?)
- Transversals and bipancyclicity in bipartite graph families
- A sufficient condition for vertex bipancyclicity in balanced bipartite graphs
- Title not available (Why is that?)
- Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs
- Uniquely Bipancyclic Graphs on Thirty-two Vertices
- Sufficient conditions for a balanced bipartite digraph to be even pancyclic
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)
