Weakly bipancyclic bipartite graphs

DOI10.1016/J.DAM.2015.05.006zbMath1319.05079OpenAlexW878432393MaRDI QIDQ494430

Jing Sun, Zhi-quan Hu

Publication date: 1 September 2015

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

Full work available at URL: https://doi.org/10.1016/j.dam.2015.05.006

zbMATH Keywords

bipartite graphHamiltonian cycleminimum degreeweakly bipancyclic

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (1)

Binding number, minimum degree and bipancyclism in bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pancyclism in hamiltonian graphs
• Hamiltonian pancyclic graphs
• Hamilton cycles in regular 2-connected graphs
• Hamilton cycles in 2-connected regular bipartite graphs
• An Optimal Binding Number Condition for Bipancyclism
• Hamiltonian graphs involving neighborhood unions
• Hamilton cycles in claw-free graphs
• Weakly pancyclic graphs

This page was built for publication: Weakly bipancyclic bipartite graphs