Toughness and Vertex Degrees

DOI10.1002/jgt.21639zbMath1259.05040arXiv0912.2919OpenAlexW1954993382MaRDI QIDQ4908831

Edward F. Schmeichel, Nathan Kahl, Jan van den Heuvel, Hajo J. Broersma, Douglas Bauer

Publication date: 7 March 2013

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

Full work available at URL: https://arxiv.org/abs/0912.2919

zbMATH Keywords

toughnessdegree sequencesbest monotone theorem

Mathematics Subject Classification ID

Vertex degrees (05C07)

Related Items (6)

Stability theorems for graph vulnerability parameters ⋮ New results on degree sequences of uniform hypergraphs ⋮ Wiener index and vulnerability parameters of graphs ⋮ Best monotone degree conditions for binding number ⋮ Best monotone degree conditions for graph properties: a survey ⋮ Best monotone degree conditions for binding number and cycle structure

Cites Work

• Unnamed Item
• Realizability and uniqueness in graphs
• On Hamilton's ideals
• The strongest monotone degree condition for \(n\)-connectedness of a graph

This page was built for publication: Toughness and Vertex Degrees