On 2-regular subgraphs in polyhedral graphs Original Research Article

We show that every polyhedral graph G contains a 2-regular subgraph U such that G−U is a forest of trees with at most three leaves. With this tool we give a partial solution of a problem posed in a problem session at the Workshop “Cycles and Colourings ’98” in Stará Lesná, Slovakia.