Decomposing series-parallel graphs into paths of length 3 and triangles

DOI10.1016/j.endm.2015.06.051zbMath1346.05236OpenAlexW2180402802MaRDI QIDQ322267

Martin Merker

Publication date: 14 October 2016

Full work available at URL: https://orbit.dtu.dk/en/publications/79b50524-2b1e-4070-a2d6-1f929a5a541f

zbMATH Keywords

planar graphseries-parallel graph2-edge-connected3-path decompositionedge-decomposition

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Related Items (4)

Decompositions of highly connected graphs into paths of any given length ⋮ Decomposing highly edge-connected graphs into paths of any given length ⋮ Pack graphs with subgraphs of size three ⋮ \(\alpha\)-diperfect digraphs

Cites Work

• A note on edge-decompositions of planar graphs
• Decompositions of highly connected graphs into paths of length 3
• On partitioning the edges of graphs into connected subgraphs

This page was built for publication: Decomposing series-parallel graphs into paths of length 3 and triangles