Binding number, minimum degree and bipancyclism in bipartite graphs

DOI10.1007/S11859-016-1195-0zbMath1374.05066OpenAlexW2529371455MaRDI QIDQ5282775

Zhi-quan Hu, Jing Sun

Publication date: 14 July 2017

Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11859-016-1195-0

zbMATH Keywords

Hamiltonian graphminimum degreebalanced bipartite graphbipancyclismbipartite binding number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Weakly bipancyclic bipartite graphs
• The binding number of a graph and its pancyclism
• Hamilton cycles in 2-connected regular bipartite graphs
• An Optimal Binding Number Condition for Bipancyclism
• Binding Number, Minimum Degree, and Cycle Structure in Graphs
• The binding number of a graph and its Anderson number

This page was built for publication: Binding number, minimum degree and bipancyclism in bipartite graphs