Best monotone degree conditions for binding number

DOI10.1016/J.DISC.2011.04.034zbMATH Open1283.05139OpenAlexW2001778193MaRDI QIDQ641165FDOQ641165

Authors: M. Yatauro, D. Bauer, Nathan Kahl, E. Schmeichel 

Publication date: 21 October 2011

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.04.034

Recommendations

• Best monotone degree conditions for binding number and cycle structure
• Best monotone degree condition for 1-binding graphs to contain a 1-factor
• Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor
• Vertex degrees, binding number, and 2-factors
• scientific article; zbMATH DE number 3985279

zbMATH Keywords

degree sequencebinding numberbest monotone degree improvementbest monotone theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• On Hamilton's ideals
• Title not available (Why is that?)
• Sufficient degree conditions for \(k\)-edge-connectedness of a graph
• A method in graph theory
• Pancyclic graphs and a conjecture of Bondy and Chvatal
• The binding number of a graph and its Anderson number
• Toughness and vertex degrees
• Binding numbers and \(f\)-factors of graphs
• A sufficient condition for Hamiltonian circuits
• Computing the binding number of a graph
• Binding number and toughness for matching extension
• Degree sequences and the existence of \(k\)-factors
• The strongest monotone degree condition for \(n\)-connectedness of a graph
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• Title not available (Why is that?)
• The binding number of a graph and its pancyclism
• The binding number of a graph and its cliques
• Binding number conditions for matching extension

Cited In (10)

• Best monotone degree condition for 1-binding graphs to contain a 1-factor
• An optimal binding number condition for bipancyclism
• Some results on vulnerability parameters and Wiener-type indices
• Vertex degrees, binding number, and 2-factors
• Stability theorems for graph vulnerability parameters
• Binding number, \(k\)-factor and spectral radius of graphs
• Best monotone degree conditions for graph properties: a survey
• Best monotone degree conditions for binding number and cycle structure
• Wiener index and vulnerability parameters of graphs
• Parameterized binding numbers and degree sequence theorems

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

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