Pages that link to "Item:Q1923610"
From MaRDI portal
The following pages link to Parallel complexity of partitioning a planar graph into vertex-induced forests (Q1923610):
Displaying 6 items.
- Vertex-arboricity of planar graphs without intersecting triangles (Q412284) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Efficient algorithms for acyclic colorings of graphs (Q1978502) (← links)
- On the vertex-arboricity of planar graphs (Q2427551) (← links)
- Vertex arboricity of planar graphs without chordal 6-cycles (Q2868169) (← links)
- Drawing Graphs on Few Lines and Few Planes (Q2961513) (← links)
