A sufficient condition for vertex bipancyclicity in balanced bipartite graphs
From MaRDI portal
Publication:6172209
DOI10.1007/s00373-023-02668-2zbMath1518.05100MaRDI QIDQ6172209
Wei Meng, Chun-Fang Li, Ruixia Wang, Qiao-Ping Guo
Publication date: 19 July 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Applying a condition for a Hamiltonian bipartite graph to be bipancyclic
- New sufficient conditions for cycles in graphs
- An efficient condition for a graph to be Hamiltonian
- On Hamiltonian bipartite graphs
- Note on Hamilton Circuits
- Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs
This page was built for publication: A sufficient condition for vertex bipancyclicity in balanced bipartite graphs