Decomposing planar cubic graphs
classification
🧮 math.CO
keywords
cubicconjectureconnectedgraphsclassdecomposeddecomposingdecomposition
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.