Pages that link to "Item:Q3553247"
From MaRDI portal
The following pages link to Partitioning a Planar Graph of Girth 10 into a Forest and a Matching (Q3553247):
Displaying 8 items.
- Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) (Q345121) (← links)
- The coloring game on planar graphs with large girth, by a result on sparse cactuses (Q512597) (← links)
- Decomposing a planar graph with girth at least 8 into a forest and a matching (Q534048) (← links)
- Decomposing a planar graph with girth 9 into a forest and a matching (Q925026) (← links)
- Planar graphs decomposable into a forest and a matching (Q998522) (← links)
- Covering planar graphs with forests, one having bounded maximum degree (Q1003834) (← links)
- Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph (Q2121792) (← links)
- Decomposition of sparse graphs into forests and a graph with bounded degree (Q2862551) (← links)