ARTICLE
Decomposing planar cubic graphs
Contract grant sponsor: Austrian Science Fund (FWF); contract grant number: P 26686.
Contract grant sponsor: Czech Science Foundation; contract grant number: GA14-19503S.
Contract grant sponsor: JST ERATO, Japan; contract grant number: JPMJER1201.
Abstract
The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs.
