Decomposing a graph into forests and a matching

DOI10.1016/J.JCTB.2018.01.005zbMATH Open1387.05213OpenAlexW2788059463MaRDI QIDQ1748265FDOQ1748265

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

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

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)

Cites Work

• On the degrees of the vertices of a directed graph
• Decomposition of Finite Graphs Into Forests
• Minimum partition of a matroid into independent subsets
• Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)
• Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• Decomposition of sparse graphs into forests and a graph with bounded degree
• Decomposing a graph into forests
• Decomposition of sparse graphs, with application to game coloring number
• The intersection of a matroid and a simplicial complex
• Decomposing a graph into pseudoforests with one having bounded degree
• Covering a graph by forests and a matching

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
• Extensions of matroid covering and packing
• Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)
• 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
• Title not available (Why is that?)

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)