Best monotone degree conditions for binding number and cycle structure

DOI10.1016/J.DAM.2013.12.014MaRDI QIDQ496429zbMATH OpenOpenAlexFDO

Authors M. Yatauro, A. Nevo, D. Bauer, E. Schmeichel, Douglas R. Woodall

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

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

Recommendations

• Best monotone degree conditions for binding number
• scientific article; zbMATH DE number 5532153
• Best monotone degree condition for 1-binding graphs to contain a 1-factor
• Best monotone degree conditions for graph properties: a survey
• Minimum degree conditions for monochromatic cycle partitioning
• An optimal binding number condition for bipancyclism
• Binding number, minimum degree, and cycle structure in graphs
• Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor
• Monochromatic cycle partitions of graphs with large minimum degree
• Binding number, minimum degree and bipancyclism in bipartite graphs

Cites work

• scientific article; zbMATH DE number 3293646 (Why is no real title available?)
• scientific article; zbMATH DE number 3186565 (Why is no real title available?)
• A method in graph theory
• A sufficient condition for Hamiltonian circuits
• Best monotone degree conditions for binding number
• Binding number, minimum degree, and cycle structure in graphs
• Degree sequences and the existence of \(k\)-factors
• On Hamilton's ideals
• Some Theorems on Abstract Graphs
• Sufficient degree conditions for \(k\)-edge-connectedness of a graph
• The binding number of a graph and its Anderson number
• The strongest monotone degree condition for \(n\)-connectedness of a graph
• Toughness and vertex degrees

Cited in

(6)

• Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor
• Best monotone degree condition for 1-binding graphs to contain a 1-factor
• Minimum degree conditions for monochromatic cycle partitioning
• An optimal binding number condition for bipancyclism
• Best monotone degree conditions for graph properties: a survey
• Best monotone degree conditions for binding number

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496429)