# Erik Engbers

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.

- Full text PDF available (1)

Learn More

- Hajo Broersma, Erik Engbers, Huib Trommel
- Networks
- 1999

Let G be a graph, and let t ≥ 0 be a real number. Then G is t-tough if tω(G − S) ≤ |S| for all S ⊆ V (G) with ω(G− S) > 1, where ω(G− S) denotes the number of components of G − S. The toughness of G, denoted by τ(G), is the maximum value of t for which G is t-tough (taking τ(Kn) = ∞ for all n ≥ 1). G is minimally t-tough if τ(G) = t and τ(H) < t for every… (More)

- ‹
- 1
- ›