Binding number, minimum degree and bipancyclism in bipartite graphs

DOI10.1007/S11859-016-1195-0zbMATH Open1374.05066OpenAlexW2529371455MaRDI QIDQ5282775FDOQ5282775

Authors: Jing Sun, Zhiquan Hu 

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

Recommendations

• An optimal binding number condition for bipancyclism
• A sufficient condition for vertex bipancyclicity in balanced bipartite graphs
• Weakly bipancyclic bipartite graphs
• Cyclability and pancyclability in bipartite graphs
• scientific article; zbMATH DE number 638674

zbMATH Keywords

minimum degreeHamiltonian graphbalanced bipartite graphbipancyclismbipartite binding number

Mathematics Subject Classification ID

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

Cites Work

• Graph theory with applications
• Hamilton cycles in 2-connected regular bipartite graphs
• The binding number of a graph and its Anderson number
• Binding number, minimum degree, and cycle structure in graphs
• The binding number of a graph and its pancyclism
• An optimal binding number condition for bipancyclism
• Weakly bipancyclic bipartite graphs
• A sufficient condition for Hamiltonians in balanced bipartite graphs

Cited In (8)

• An optimal binding number condition for bipancyclism
• Binding number, cycles, and cliques
• Bipancyclicism and bipanconnectivity in bipartite graphs
• Title not available (Why is that?)
• Transversals and bipancyclicity in bipartite graph families
• A sufficient condition for vertex bipancyclicity in balanced bipartite graphs
• Cyclability and pancyclability in bipartite graphs
• Best monotone degree conditions for binding number and cycle structure

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

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