Decomposing a graph into forests and a matching

DOI10.1016/J.JCTB.2018.01.005MaRDI QIDQ1748265zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Decomposing a graph into forests: the nine dragon tree conjecture is true
• Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)
• Decomposition of sparse graphs into forests and a graph with bounded degree
• Covering a graph by forests and a matching
• Decomposing a graph into forests

Cites work

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

Cited in

(15)

• Decomposing graphs into a spanning tree, an even graph, and a star forest
• The strong nine dragon tree conjecture is true for \(d \le k + 1\)
• Decomposition of sparse graphs into forests and a graph with bounded degree
• Decomposing a graph into forests: the nine dragon tree conjecture is true
• Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)
• Extensions of matroid covering and packing
• Digraph analogues for the Nine Dragon Tree Conjecture
• Covering a graph by forests and a matching
• Decompositions of graphs into forests with bounded maximum degree
• The pseudoforest analogue for the strong nine dragon tree conjecture is true
• Decomposing a planar graph with girth at least 8 into a forest and a matching
• Decomposing a graph into pseudoforests with one having bounded degree
• Decomposing a graph into forests
• An extension of Nash-Williams and Tutte's theorem
• scientific article; zbMATH DE number 4008408 (Why is no real title available?)

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

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