| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648297 | Discrete Mathematics | 2011 | 7 Pages |
Abstract
We give sufficient conditions on the vertex degrees of a graph GG to guarantee that GG has binding number at least bb, for any given b>0b>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
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
D. Bauer, M. Yatauro, N. Kahl, E. Schmeichel,