File:Graph toughness.svg
Summary
| Description |
English: In this graph, removing the four red vertices would produce four connected components. However, there is no set of k vertices whose removal leaves more than k components. Therefore, its toughness is exactly 1. |
| Date | |
| Source | Own work |
| Author | David Eppstein |
Licensing
 |
I, the copyright holder of this work, release this work into the public domain. This applies worldwide. In some countries this may not be legally possible; if so: I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law. |
