An optimal binding number condition for bipancyclism

DOI10.1137/120886443MaRDI QIDQ2848523zbMATH OpenOpenAlexFDO

Authors Zhiquan Hu, Ka Ho Law, Wenan Zang

Publication date 26 September 2013

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10722/185942

zbMATH Keywords

Hamiltonian cyclebipartite graphbinding numberbipancyclism

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• Best monotone degree conditions for binding number and cycle structure
• Binding number, minimum degree and bipancyclism in bipartite graphs
• The binding number of a graph and its pancyclism
• On the number of bounding cycles for nonlinear arrangements
• A sufficient condition for maximum cycles in bipartite digraphs
• scientific article; zbMATH DE number 1071797
• Best monotone degree conditions for binding number
• scientific article; zbMATH DE number 3941585
• New sufficient conditions for bipancyclic bipartite graphs
• BINDING NUMBER CONDITIONS FOR (a, b, k)-CRITICAL GRAPHS

Cited in

(8)

• Bipartite binding number, k-factor and spectral radius of bipartite graphs
• Bipancyclicism and bipanconnectivity in bipartite graphs
• Binding number, cycles, and cliques
• The binding number of a graph and its circuits
• Best monotone degree conditions for binding number and cycle structure
• Binding number, minimum degree and bipancyclism in bipartite graphs
• Weakly bipancyclic bipartite graphs
• The binding number of a graph and its pancyclism

This page was built for publication: An optimal binding number condition for bipancyclism

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