The following pages link to (Q5284057):
Displaying 4 items.
- Simple planar graph partition into three forests (Q1392570) (← links)
- On the vertex arboricity of planar graphs of diameter two (Q2384426) (← links)
- On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree (Q2423361) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)