Efficient algorithms for vertex arboricity of planar graphs

DOI10.1007/3-540-60692-0_39MaRDI QIDQ2956672zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Efficient algorithms for acyclic colorings of graphs
• Acyclic colorings of planar graphs
• Acyclic colorings of subcubic graphs
• On the vertex-arboricity of planar graphs
• Acyclically 3-colorable planar graphs

Cited in

(9)

• Simple planar graph partition into three forests
• Vertex arboricity of planar graphs without intersecting 5-cycles
• Efficient algorithms for acyclic colorings of graphs
• On the vertex arboricity of planar graphs of diameter two
• Coloring graphs using two colors while avoiding monochromatic cycles
• Vertex arboricity of planar graphs without chordal 6-cycles
• How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
• On the vertex-arboricity of planar graphs without 7-cycles
• Some recent progress and applications in graph minor theory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2956672)