Best monotone degree conditions for binding number and cycle structure

DOI10.1016/J.DAM.2013.12.014zbMATH Open1320.05067OpenAlexW2045073432MaRDI QIDQ496429FDOQ496429

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

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

zbMATH Keywords

cycle structuredegree sequencetoughnessbinding numberbest monotone

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• 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
• Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor

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)