Decomposing plane cubic graphs

3 years 19 days ago
Decomposing plane cubic graphs
It was conjectured by Hoffmann-Ostenhof that the edge set of every cubic graph can be decomposed into a spanning tree, a matching and a family of cycles. We prove the conjecture for 3-connected cubic plane graphs and 3-connected cubic graphs on the projective plane. Our proof provides a polynomial time algorithm to find the decomposition for 3-connected cubic plane graphs.
Kenta Ozeki, Dong Ye 0002
Added 02 Apr 2016
Updated 02 Apr 2016
Type Journal
Year 2016
Where EJC
Authors Kenta Ozeki, Dong Ye 0002
Comments (0)