Decomposing a graph into forests: the nine dragon tree conjecture is true

DOI10.1007/s00493-016-3390-1zbMath1399.05034OpenAlexW2535651506WikidataQ122923058 ScholiaQ122923058MaRDI QIDQ722313

Daqing Yang, Hongbi Jiang

Publication date: 23 July 2018

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-016-3390-1

zbMATH Keywords

nine dragon tree conjecturedecomposing a graph

Mathematics Subject Classification ID

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

Related Items (7)

Extensions of matroid covering and packing ⋮ Spanning Rigid Subgraph Packing and Sparse Subgraph Covering ⋮ Colouring planar graphs with bounded monochromatic components ⋮ Digraph analogues for the Nine Dragon Tree Conjecture ⋮ Decomposing planar graphs into graphs with degree restrictions ⋮ The pseudoforest analogue for the strong nine dragon tree conjecture is true ⋮ An enhancement of Nash-Williams' theorem on edge arboricity of graphs

Cites Work

• Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)
• Decomposing a graph into pseudoforests with one having bounded degree
• Decomposing a graph into forests
• Covering planar graphs with forests, one having bounded maximum degree
• Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• The game coloring number of planar graphs
• Covering planar graphs with forests
• On the degrees of the vertices of a directed graph
• Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
• A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory

This page was built for publication: Decomposing a graph into forests: the nine dragon tree conjecture is true