Pages that link to "Item:Q722313"
From MaRDI portal
The following pages link to Decomposing a graph into forests: the nine dragon tree conjecture is true (Q722313):
Displaying 12 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)
- Extensions of matroid covering and packing (Q1633609) (← links)
- Decomposing a graph into forests and a matching (Q1748265) (← links)
- An enhancement of Nash-Williams' theorem on edge arboricity of graphs (Q1750785) (← links)
- Colouring planar graphs with bounded monochromatic components (Q2182229) (← links)
- The pseudoforest analogue for the strong nine dragon tree conjecture is true (Q2200931) (← links)
- Decomposition of sparse graphs into forests and a graph with bounded degree (Q2862551) (← links)
- Spanning Rigid Subgraph Packing and Sparse Subgraph Covering (Q4568066) (← links)
- Digraph analogues for the Nine Dragon Tree Conjecture (Q6046686) (← links)
- Decomposing planar graphs into graphs with degree restrictions (Q6081583) (← links)
- An extension of Nash-Williams and Tutte's theorem (Q6657600) (← links)