Decomposing graphs into paths and trees

DOI10.1016/J.ENDM.2017.07.032MaRDI QIDQ1690003zbMATH OpenOpenAlexFDO

Authors Tereza Klimošová, Sté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 decompositiondecomposition into pathsBarát-Thomassen conjecture

Mathematics Subject Classification ID

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

Recommendations

• Decomposing highly edge-connected graphs into paths of any given length
• Decompositions of highly connected graphs into paths of any given length
• Edge‐decomposing graphs into coprime forests
• Decomposing graphs into paths of fixed length
• Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree

Cites work

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

Cited in

(11)

• Decomposing graphs into a spanning tree, an even graph, and a star forest
• Decomposing highly connected graphs into paths of length five
• Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree
• Decomposition of graphs into trees with bounded maximum degree
• Decompositions of graphs into trees
• Decomposing series-parallel graphs into paths of length 3 and triangles
• Generation of trees of a graph with the use of decomposition
• Decomposing graphs into paths of fixed length
• On the structure of a smallest counterexample and a new class verifying the 2-decomposition conjecture
• Decomposing highly edge-connected graphs into paths of any given length
• Edge‐decomposing graphs into coprime forests

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

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