Best monotone degree conditions for binding number and cycle structure

DOI10.1016/j.dam.2013.12.014zbMath1320.05067OpenAlexW2045073432MaRDI QIDQ496429

M. Yatauro, A. Nevo, Douglas Bauer, Douglas R. Woodall, Edward F. Schmeichel

Publication date: 21 September 2015

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

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

zbMATH Keywords

cycle structuredegree sequencetoughnessbinding numberbest monotone

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (2)

Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor ⋮ Best monotone degree conditions for graph properties: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Best monotone degree conditions for binding number
• A sufficient condition for Hamiltonian circuits
• A method in graph theory
• Degree sequences and the existence of \(k\)-factors
• On Hamilton's ideals
• The strongest monotone degree condition for \(n\)-connectedness of a graph
• Binding Number, Minimum Degree, and Cycle Structure in Graphs
• Sufficient degree conditions fork-edge-connectedness of a graph
• Toughness and Vertex Degrees
• The binding number of a graph and its Anderson number
• Some Theorems on Abstract Graphs

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