Pages that link to "Item:Q345121"
From MaRDI portal
The following pages link to Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) (Q345121):
Displaying 5 items.
- I,F-partitions of sparse graphs (Q298327) (← links)
- Decomposing a graph into forests: the nine dragon tree conjecture is true (Q722313) (← links)
- Decomposing 4-connected planar triangulations into two trees and one path (Q1633745) (← links)
- Decomposing a graph into forests and a matching (Q1748265) (← links)
- An enhancement of Nash-Williams' theorem on edge arboricity of graphs (Q1750785) (← links)
