Publication at Faculty of Mathematics and Physics |
2006
Abstract
We show that every 3-connected planar graph distinct from K_4 contains an edge that is both light and contractible. A consequence is that every 3-polytope can be constructed from tetrahedron by a sequence of splittings of vertices of degree at most 11.