arXiv Analytics

Sign in

arXiv:1609.05059 [math.CO]AbstractReferencesReviewsResources

Decomposing planar cubic graphs

Arthur Hoffmann-Ostenhof, Tomáš Kaiser, Kenta Ozeki

Published 2016-09-16Version 1

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.

Categories: math.CO
Subjects: 05C70, 05C10
Related articles: Most relevant | Search more
arXiv:2003.13139 [math.CO] (Published 2020-03-29)
The 1-2-3 Conjecture holds for graphs with large enough minimum degree
arXiv:1607.04768 [math.CO] (Published 2016-07-16)
Hoffmann-Ostenhof's conjecture for traceable cubic graphs
arXiv:2405.15733 [math.CO] (Published 2024-05-24)
Embedding Nearly Spanning Trees

Links

Toolbox