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

DOI10.1016/J.ENDM.2015.06.051MaRDI QIDQ322267zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Decompositions of highly connected graphs into paths of length 3
• Decomposing graphs into long paths
• Decomposing planar cubic graphs
• Gallai's path decomposition conjecture for triangle-free planar graphs
• Decomposing graphs into paths and trees

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

Cited in

(6)

• Pack graphs with subgraphs of size three
• \(\alpha\)-diperfect digraphs
• Decomposing toroidal graphs into circuits and edges
• Decomposing 4-connected planar triangulations into two trees and one path
• Decompositions of highly connected graphs into paths of any given length
• Decomposing highly edge-connected graphs into paths of any given length

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322267)