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

DOI10.1007/S00493-016-3390-1MaRDI QIDQ722313zbMATH OpenOpenAlexWikidataFDO

Authors Hongbi Jiang, Daqing Yang

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

decomposing a graphnine dragon tree conjecture

Mathematics Subject Classification ID

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

Recommendations

• Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)
• The pseudoforest analogue for the strong nine dragon tree conjecture is true
• Digraph analogues for the Nine Dragon Tree Conjecture
• Decomposing a planar graph with girth 9 into a forest and a matching
• Decomposition of Finite Graphs Into Forests
• scientific article; zbMATH DE number 91047
• Decomposing a graph into forests
• Nash-Williams' theorem on decomposing graphs into forests
• Decomposing a graph into forests and a matching
• \(k\)-connectivity and decomposition of graphs into forests

Cites work

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

Cited in

(19)

• Extensions of matroid covering and packing
• Decomposing a graph into forests and a matching
• An enhancement of Nash-Williams' theorem on edge arboricity of graphs
• Colouring planar graphs with bounded monochromatic components
• The pseudoforest analogue for the strong nine dragon tree conjecture is true
• Decomposition of sparse graphs into forests and a graph with bounded degree
• Covering a graph by forests and a matching
• Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)
• Spanning Rigid Subgraph Packing and Sparse Subgraph Covering
• Decomposing a graph into pseudoforests with one having bounded degree
• Digraph analogues for the Nine Dragon Tree Conjecture
• Decomposing planar graphs into graphs with degree restrictions
• The strong nine dragon tree conjecture is true for d k + 1
• An extension of Nash-Williams and Tutte's theorem
• Beyond the pseudoforest strong nine dragon tree theorem
• The overfull nine dragon tree conjecture is true
• Resolution of the Kohayakawa-Kreuter conjecture
• The arboricity of graphs with minimum genus embeddings
• On the anti-Ramsey threshold

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

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