Pages that link to "Item:Q2862551"
From MaRDI portal
The following pages link to Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree (Q2862551):
Displaying 17 items.
- Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) (Q345121) (← links)
- Decomposing a graph into pseudoforests with one having bounded degree (Q490985) (← links)
- Decomposing a planar graph with girth at least 8 into a forest and a matching (Q534048) (← links)
- Decomposing a graph into forests: the nine dragon tree conjecture is true (Q722313) (← links)
- Triangle decompositions of planar graphs (Q726643) (← links)
- Decomposing a graph into forests (Q765188) (← links)
- Decomposing plane cubic graphs (Q896062) (← links)
- Decomposing 4-connected planar triangulations into two trees and one path (Q1633745) (← links)
- Spanning tree with lower bound on the degrees (Q1744244) (← links)
- Decomposing a graph into forests and a matching (Q1748265) (← links)
- An enhancement of Nash-Williams' theorem on edge arboricity of graphs (Q1750785) (← links)
- Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph (Q2121792) (← links)
- Colouring planar graphs with bounded monochromatic components (Q2182229) (← links)
- The pseudoforest analogue for the strong nine dragon tree conjecture is true (Q2200931) (← links)
- Degree Bounded Forest Covering (Q3009772) (← links)
- Spanning Rigid Subgraph Packing and Sparse Subgraph Covering (Q4568066) (← links)
- Digraph analogues for the Nine Dragon Tree Conjecture (Q6046686) (← links)
