Tutte’s wheel theorem
Every 3-connected (http://planetmath.org/KConnectedGraph) simple graph
can be constructed starting from a wheel graph by repeatedly either adding an edge between two non-adjacent vertices or splitting a vertex.
| Title | Tutte’s wheel theorem |
|---|---|
| Canonical name | TuttesWheelTheorem |
| Date of creation | 2013-03-22 13:11:06 |
| Last modified on | 2013-03-22 13:11:06 |
| Owner | lieven (1075) |
| Last modified by | lieven (1075) |
| Numerical id | 4 |
| Author | lieven (1075) |
| Entry type | Theorem |
| Classification | msc 05C40 |