Title of article
Best monotone degree conditions for binding number
Author/Authors
Bauer، نويسنده , , D. and Yatauro، نويسنده , , M. and Kahl، نويسنده , , N. and Schmeichel، نويسنده , , E.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
7
From page
2037
To page
2043
Abstract
We give sufficient conditions on the vertex degrees of a graph G to guarantee that G has binding number at least b , for any given b > 0 . Our conditions are best possible in exactly the same way that Chvátal’s well-known degree condition to guarantee a graph is Hamiltonian is best possible.
Keywords
binding number , Degree sequence , Best monotone theorem , Best monotone degree improvement
Journal title
Discrete Mathematics
Serial Year
2011
Journal title
Discrete Mathematics
Record number
1598423
Link To Document