Pages that link to "Item:Q2956672"
From MaRDI portal
The following pages link to Efficient algorithms for vertex arboricity of planar graphs (Q2956672):
Displaying 8 items.
- On the vertex-arboricity of planar graphs without 7-cycles (Q442319) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Simple planar graph partition into three forests (Q1392570) (← links)
- Vertex arboricity of planar graphs without intersecting 5-cycles (Q1702820) (← links)
- Efficient algorithms for acyclic colorings of graphs (Q1978502) (← links)
- On the vertex arboricity of planar graphs of diameter two (Q2384426) (← links)
- Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles (Q2815462) (← links)
- Vertex arboricity of planar graphs without chordal 6-cycles (Q2868169) (← links)
