Every 3-connected graph can be uniquely decomposed into parts that are either quasi 4-connected, wheels, or thickened K3,m's.
