| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 418869 | Discrete Applied Mathematics | 2014 | 9 Pages |
Abstract
Let τ(G)τ(G) and bind(G) be the toughness and binding number, respectively, of a graph GG. Woodall observed in 1973 that τ(G)⩾bind(G)−1. In this paper, we obtain best possible improvements of this inequality except when (1+5)/2
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
D. Bauer, N. Kahl, E. Schmeichel, D.R. Woodall, M. Yatauro,