Decomposition of cubic graphs with a 2-factor consisting of three cycles |
| |
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 prove that this conjecture is true for connected cubic graphs with a 2-factor consisting of three cycles. |
| |
Keywords: | Cubic graphs 2-factor Spanning tree Decomposition |
本文献已被 ScienceDirect 等数据库收录! |