Toughness and binding number

DOI10.1016/j.dam.2012.08.007zbMath1288.05134OpenAlexW2011033652MaRDI QIDQ2448921

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

Publication date: 5 May 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2012.08.007

zbMATH Keywords

toughnessbinding number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (4)

Toughness, binding number and restricted matching extension in a graph ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Recognizing tough graphs is NP-hard
• The complexity of recognizing tough cubic graphs
• Computing the binding number of a graph
• On Hamilton's ideals
• On the Toughness of a Graph
• The binding number of a graph and its Anderson number

This page was built for publication: Toughness and binding number