Best monotone degree conditions for binding number

DOI10.1016/j.disc.2011.04.034zbMath1283.05139OpenAlexW2001778193MaRDI QIDQ641165

M. Yatauro, Edward F. Schmeichel, Douglas Bauer, Nathan Kahl

Publication date: 21 October 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.04.034

zbMATH Keywords

degree sequencebinding numberbest monotone degree improvementbest monotone theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Stability theorems for graph vulnerability parameters ⋮ Wiener index and vulnerability parameters of graphs ⋮ Binding number, \(k\)-factor and spectral radius of graphs ⋮ 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
• The binding number of a graph and its cliques
• Binding numbers and \(f\)-factors of graphs
• A sufficient condition for Hamiltonian circuits
• A method in graph theory
• Pancyclic graphs and a conjecture of Bondy and Chvatal
• Binding number conditions for matching extension
• Computing the binding number of a graph
• Binding number and toughness for matching extension
• Degree sequences and the existence of \(k\)-factors
• On Hamilton's ideals
• The strongest monotone degree condition for \(n\)-connectedness of a graph
• Sufficient degree conditions fork-edge-connectedness of a graph
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• Toughness and Vertex Degrees
• The binding number of a graph and its Anderson number

This page was built for publication: Best monotone degree conditions for binding number