Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture (Q2322499)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture |
scientific article |
Statements
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture (English)
0 references
4 September 2019
0 references
\textit{J. Barát} and \textit{C. Thomassen} [J. Graph Theory 52, No. 2, 135--146 (2006; Zbl 1117.05088)] conjectured that highly edge-connected graphs can be decomposed into copies of any tree. The path case of the conjecture was previously established. The authors provide an alternative proof of the path case with weaker edge-connectivity requirement.
0 references
edge-connectivity
0 references
graph decomposition
0 references
minimum degree
0 references
