Pages that link to "Item:Q1775897"
From MaRDI portal
The following pages link to Covering planar graphs with forests (Q1775897):
Displaying 30 items.
- Light and low 5-stars in normal plane maps with minimum degree 5 (Q311243) (← links)
- Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) (Q345121) (← links)
- Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps (Q383686) (← links)
- Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5 (Q383687) (← links)
- Decomposition of sparse graphs into two forests, one having bounded maximum degree (Q407602) (← links)
- Edge covering pseudo-outerplanar graphs with forests (Q449118) (← links)
- Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
- Decomposing a graph into pseudoforests with one having bounded degree (Q490985) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices (Q526251) (← links)
- Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476) (← links)
- Decomposing a graph into forests: the nine dragon tree conjecture is true (Q722313) (← links)
- Decomposing a graph into forests (Q765188) (← links)
- Decomposing plane cubic graphs (Q896062) (← links)
- Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices (Q898158) (← links)
- Decomposing a planar graph with girth 9 into a forest and a matching (Q925026) (← links)
- Decomposition of sparse graphs, with application to game coloring number (Q968426) (← links)
- Covering planar graphs with forests, one having bounded maximum degree (Q1003834) (← links)
- Decomposing 4-connected planar triangulations into two trees and one path (Q1633745) (← links)
- Low and light 5-stars in 3-polytopes with minimum degree 5 and restrictions on the degrees of major vertices (Q1675168) (← links)
- Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7 (Q1690254) (← links)
- Covering projective planar graphs with three forests (Q2075505) (← links)
- Towards obtaining a 3-decomposition from a perfect matching (Q2094896) (← links)
- Soft 3-stars in sparse plane graphs (Q2212724) (← links)
- Low 5-stars in normal plane maps with minimum degree 5 (Q2374153) (← links)
- On the existence of specific stars in planar graphs (Q2464048) (← links)
- 5-stars of low weight in normal plane maps with minimum degree 5 (Q2509542) (← links)
- Light 3-stars in sparse plane graphs (Q2633370) (← links)
- Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree (Q2862551) (← links)
- Covering planar graphs with forests, one having a bounded maximum degree (Q5301001) (← links)
