Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)

DOI10.1016/j.jctb.2016.09.004zbMath1350.05084arXiv1502.04755OpenAlexW2118439290MaRDI QIDQ345121

Douglas B. West, Seog-Jin Kim, Xuding Zhu, Min Chen, Alexandr V. Kostochka

Publication date: 25 November 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.04755

zbMATH Keywords

forestgraph decompositionarboricitydischarging methodfractional arboricityNash-Williams arboricity formulanine dragon tree conjecturesparse graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Density (toughness, etc.) (05C42)

Related Items (6)

I,F-partitions of sparse graphs ⋮ Decomposing 4-connected planar triangulations into two trees and one path ⋮ Digraph analogues for the Nine Dragon Tree Conjecture ⋮ Decomposing a graph into forests and a matching ⋮ An enhancement of Nash-Williams' theorem on edge arboricity of graphs ⋮ Decomposing a graph into forests: the nine dragon tree conjecture is true

Cites Work

• Decomposing a planar graph with girth at least 8 into a forest and a matching
• Decomposing a graph into forests
• Decomposing a planar graph with girth 9 into a forest and a matching
• Decomposition of sparse graphs, with application to game coloring number
• Planar graphs decomposable into a forest and a matching
• Covering planar graphs with forests, one having bounded maximum degree
• Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
• Covering planar graphs with forests
• Decomposing a planar graph into a forest and a subgraph of restricted maximum degree
• Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
• Partitioning a Planar Graph of Girth 10 into a Forest and a Matching
• Edge-partitions of planar graphs and their game coloring numbers
• Decompositions of quadrangle-free planar graphs
• Decomposition of Finite Graphs Into Forests

This page was built for publication: Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)