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 17 items.
- Decomposing a planar graph with girth at least 8 into a forest and a matching (Q534048) (← links)
- Simple planar graph partition into three forests (Q1392570) (← links)
- Partitioning into graphs with only small components (Q1405114) (← links)
- Partitioning sparse graphs into an independent set and a forest of bounded degree (Q1753010) (← links)
- An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 (Q2099458) (← links)
- A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable (Q2146740) (← links)
- On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree (Q2423361) (← links)
- (Q3015660) (← links)
- A Rooted-Forest Partition with Uniform Vertex Demand (Q3404442) (← links)
- (Q4996553) (← links)
- (Q5284057) (← links)
- Partitioning a triangle-free planar graph into a forest and a forest of bounded degree (Q5890907) (← links)
- An (F1,F4)‐partition of graphs with low genus and girth at least 6 (Q6056804) (← 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)
