Decomposing a graph into forests and a matching

DOI10.1016/j.jctb.2018.01.005zbMath1387.05213OpenAlexW2788059463MaRDI QIDQ1748265

Daqing Yang

Publication date: 9 May 2018

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2018.01.005

zbMATH Keywords

arboricityfractional arboricitydecomposition of a graphnine dragon tree (NDT) conjecture

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (3)

Extensions of matroid covering and packing ⋮ Digraph analogues for the Nine Dragon Tree Conjecture ⋮ The pseudoforest analogue for the strong nine dragon tree conjecture is true

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
• Decomposition of sparse graphs, with application to game coloring number
• Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• On the degrees of the vertices of a directed graph
• Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
• Covering a Graph by Forests and a Matching
• The intersection of a matroid and a simplicial complex
• Minimum partition of a matroid into independent subsets
• Decomposition of Finite Graphs Into Forests

This page was built for publication: Decomposing a graph into forests and a matching