Pages that link to "Item:Q2294901"
From MaRDI portal
The following pages link to On the vertex partition of planar graphs into forests with bounded degree (Q2294901):
Displaying 5 items.
- An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 (Q2099458) (← links)
- Path partition of planar graphs with girth at least six (Q6059078) (← links)
- Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition (Q6143874) (← links)
- A sufficient condition for planar graphs with girth 5 to be \((1,6)\)-colorable (Q6585548) (← links)
- Planar graphs without cycles of length 3, 4, and 6 are (3, 3)-colorable (Q6657759) (← links)
