Pages that link to "Item:Q968426"
From MaRDI portal
The following pages link to Decomposition of sparse graphs, with application to game coloring number (Q968426):
Displaying 9 items.
- Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) (Q345121) (← links)
- Game chromatic number of graphs with locally bounded number of cycles (Q407532) (← links)
- Decomposition of sparse graphs into two forests, one having bounded maximum degree (Q407602) (← links)
- Decomposing a graph into pseudoforests with one having bounded degree (Q490985) (← links)
- Decomposing a graph into forests (Q765188) (← links)
- Decomposing 4-connected planar triangulations into two trees and one path (Q1633745) (← links)
- Decomposing a graph into forests and a matching (Q1748265) (← links)
- Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree (Q2862551) (← links)
- Degree Bounded Forest Covering (Q3009772) (← links)
