The pseudoforest analogue for the strong nine dragon tree conjecture is true

DOI10.1016/J.JCTB.2020.07.001zbMath1448.05163arXiv1905.02600OpenAlexW3043348258MaRDI QIDQ2200931

Logan Grout, Benjamin Moore

Publication date: 24 September 2020

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

Full work available at URL: https://arxiv.org/abs/1905.02600

zbMATH Keywords

graph decompositionspseudoforestsstrong nine dragon tree

Mathematics Subject Classification ID

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

Related Items (3)

Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph ⋮ Digraph analogues for the Nine Dragon Tree Conjecture ⋮ The spectral radius, maximum average degree and cycles of consecutive lengths of graphs

Cites Work

• Unnamed Item
• Decomposing a graph into pseudoforests with one having bounded degree
• Decomposing a graph into forests: the nine dragon tree conjecture is true
• Decomposing a graph into forests
• Decomposing a graph into forests and a matching
• On the degrees of the vertices of a directed graph
• Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
• Decomposition of Finite Graphs Into Forests

This page was built for publication: The pseudoforest analogue for the strong nine dragon tree conjecture is true