Journal article
Decomposing series-parallel graphs into paths of length 3 and triangles
In
Electronic Notes in Discrete Mathematics
—
2015, Volume 49, Issue November 2015, pp. 367-370
Abstract
An old conjecture by Jünger, Reinelt and Pulleyblank states that every 2-edge-connected planar graph can be decomposed into paths of length 3 and triangles, provided its size is divisible by 3. We prove the conjecture for a class of planar graphs including all 2-edge-connected series-parallel graphs.
We also present a 2-edge-connected non-planar graph that can be embedded on the torus and admits no decomposition into paths of length 3 and triangles.
| Language: | English |
|---|---|
| Year: | 2015 |
| Pages: | 367-370 |
| ISSN: | 15710653 |
| Types: | Journal article |
| DOI: | 10.1016/j.endm.2015.06.051 |
| ORCIDs: | Merker, Martin |
