Decomposing graphs into paths and trees

DOI10.1016/J.ENDM.2017.07.032zbMath1379.05089OpenAlexW2744254675MaRDI QIDQ1690003

Tereza Klimošová, Steéphan Thomassé

Publication date: 18 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.07.032

zbMATH Keywords

edge decompositionBarát-Thomassen conjecturedecomposition into paths

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Locally self-avoiding Eulerian tours

Cites Work

• Decompositions of highly connected graphs into paths of length five
• Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree
• Decomposing highly edge-connected graphs into paths of any given length
• Edge-decomposition of graphs into copies of a tree with four edges
• The weak 3-flow conjecture and the weak circular flow conjecture
• Decomposing a graph into bistars
• Edge-decompositions of highly connected graphs into paths
• Decomposing graphs into paths of fixed length
• Decompositions of highly connected graphs into paths of length 3
• Claw‐decompositions and tutte‐orientations

This page was built for publication: Decomposing graphs into paths and trees