Decomposing a graph into pseudoforests with one having bounded degree

DOI10.1016/J.JCTB.2015.05.003MaRDI QIDQ490985zbMATH OpenOpenAlexFDO

Authors Ning Song, Daqing Yang, Yan Li, Genghua Fan

Publication date 21 August 2015

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.2015.05.003

zbMATH Keywords

nine dragon tree conjecturedecomposition of graphsmaximum average degree of a graphmaximum outdegree of an oriented graphpseudoforest

Mathematics Subject Classification ID

Vertex degrees (05C07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The pseudoforest analogue for the strong nine dragon tree conjecture is true
• Decomposing a graph into forests and a matching
• 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 two forests, one having bounded maximum degree

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
• Decomposition of sparse graphs into forests and a graph with bounded degree
• 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)
• On the degrees of the vertices of a directed graph
• The game coloring number of planar graphs

Cited in

(10)

• Extensions of matroid covering and packing
• Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph
• Decompositions of graphs into forests with bounded maximum degree
• scientific article; zbMATH DE number 4008408 (Why is no real title available?)
• The \(\kappa_k\)-connectivity of line graphs
• Digraph analogues for the Nine Dragon Tree Conjecture
• Decomposing a graph into forests: the nine dragon tree conjecture is true
• Decomposing a graph into forests and a matching
• The pseudoforest analogue for the strong nine dragon tree conjecture is true
• The spectral radius, maximum average degree and cycles of consecutive lengths of graphs

This page was built for publication: Decomposing a graph into pseudoforests with one having bounded degree

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