Decomposing planar cubic graphs
Combinatorics
2017-10-31 v2
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.
Keywords
Cite
@article{arxiv.1609.05059,
title = {Decomposing planar cubic graphs},
author = {Arthur Hoffmann-Ostenhof and Tomáš Kaiser and Kenta Ozeki},
journal= {arXiv preprint arXiv:1609.05059},
year = {2017}
}