Efficient algorithms for vertex arboricity of planar graphs

DOI10.1007/3-540-60692-0_39zbMath1354.05135OpenAlexW1489979173MaRDI QIDQ2956672

Abhik Roychoudhury, Susmita Sur-Kolay

Publication date: 19 January 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60692-0_39

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

On the vertex arboricity of planar graphs of diameter two ⋮ Some recent progress and applications in graph minor theory ⋮ Simple planar graph partition into three forests ⋮ Vertex arboricity of planar graphs without intersecting 5-cycles ⋮ On the vertex-arboricity of planar graphs without 7-cycles ⋮ Efficient algorithms for acyclic colorings of graphs ⋮ Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles ⋮ Vertex arboricity of planar graphs without chordal 6-cycles

This page was built for publication: Efficient algorithms for vertex arboricity of planar graphs