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 TuttesWheelTheorem 2013-03-22 13:11:06 2013-03-22 13:11:06 lieven (1075) lieven (1075) 4 lieven (1075) Theorem msc 05C40