The binding number of a graph and its pancyclism
From MaRDI portal
Publication:580376
DOI10.1007/BF02007670zbMath0626.05052OpenAlexW70909835MaRDI QIDQ580376
Publication date: 1987
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02007670
Related Items (7)
Binding number, minimum degree and bipancyclism in bipartite graphs ⋮ Dense graphs with small clique number ⋮ Binding Number, Minimum Degree, and Cycle Structure in Graphs ⋮ Best monotone degree conditions for binding number ⋮ Best monotone degree conditions for graph properties: a survey ⋮ The binding number of a graph and its cliques ⋮ Triangles and neighbourhoods of independent sets in graphs
Cites Work
This page was built for publication: The binding number of a graph and its pancyclism