An enhancement of Nash-Williams' theorem on edge arboricity of graphs
From MaRDI portal
Publication:1750785
DOI10.17377/semi.2017.14.113zbMath1391.05206MaRDI QIDQ1750785
Publication date: 23 May 2018
Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Cites Work
- Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)
- Decomposing a graph into forests: the nine dragon tree conjecture is true
- Decomposing a graph into forests
- A short proof of Nash-Williams' theorem for the arboricity of a graph
- Decompositions of graphs into trees, forests, and regular subgraphs
- Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
- NASH‐WILLIAMS’ THEOREM ON DECOMPOSING GRAPHS INTO FORESTS
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- On the chromatic index and the cover index of a multigraph
- Decomposition of Finite Graphs Into Forests