Binding Number, Minimum Degree, and Cycle Structure in Graphs

DOI10.1002/jgt.21633zbMath1248.05105OpenAlexW1596232059MaRDI QIDQ2911065

Edward F. Schmeichel, Douglas Bauer

Publication date: 12 September 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21633

zbMATH Keywords

cycle structurebinding number

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Binding number, minimum degree and bipancyclism in bipartite graphs ⋮ Binding number, \(k\)-factor and spectral radius of graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Best monotone degree conditions for graph properties: a survey ⋮ Best monotone degree conditions for binding number and cycle structure

Cites Work

• Unnamed Item
• Unnamed Item
• The binding number of a graph and its pancyclism
• Long cycles in graphs with large degree sums
• The binding number of a graph and its triangle
• A sufficient condition for Hamiltonian circuits
• A note on dominating cycles in 2-connected graphs
• Binding number and minimum degree for k-factors
• A note on maximal triangle‐free graphs
• The binding number of a graph and its Anderson number
• Some Theorems on Abstract Graphs

This page was built for publication: Binding Number, Minimum Degree, and Cycle Structure in Graphs