Decomposing a graph into pseudoforests with one having bounded degree
From MaRDI portal
Publication:490985
DOI10.1016/j.jctb.2015.05.003zbMath1319.05104OpenAlexW2190644470MaRDI QIDQ490985
Daqing Yang, Ning Song, Yan Li, Geng-Hua 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
nine dragon tree conjecturedecomposition of graphsmaximum average degree of a graphmaximum outdegree of an oriented graphpseudoforest
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)
Related Items (8)
Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph ⋮ Extensions of matroid covering and packing ⋮ Digraph analogues for the Nine Dragon Tree Conjecture ⋮ The spectral radius, maximum average degree and cycles of consecutive lengths of graphs ⋮ The \(\kappa_k\)-connectivity of line graphs ⋮ 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
Cites Work
- Decomposing a graph into forests
- Decomposition of sparse graphs, with application to game coloring number
- Covering planar graphs with forests, one having bounded maximum degree
- Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- The game coloring number of planar graphs
- Covering planar graphs with forests
- On the degrees of the vertices of a directed graph
- Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
This page was built for publication: Decomposing a graph into pseudoforests with one having bounded degree
