Acyclic coloring with few division vertices

DOI10.1007/978-3-642-35926-2_11zbMATH Open1293.05372OpenAlexW2173731825MaRDI QIDQ2876563FDOQ2876563

Authors: Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides 

Publication date: 19 August 2014

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

Full work available at URL: https://doi.org/10.1007/978-3-642-35926-2_11

Recommendations

• Acyclic coloring with few division vertices
• Acyclic colorings of graph subdivisions revisited
• Acyclic colorings of graph subdivisions
• Acyclically 3-colorable planar graphs
• Acyclically 4-colorable triangulations

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15)

Cited In (7)

• Construction of acyclically 4-colourable planar triangulations with minimum degree 4
• Acyclic coloring with few division vertices
• A polyhedral study of the acyclic coloring problem
• Acyclic colorings of graph subdivisions
• Acyclic colorings of graph subdivisions revisited
• On acyclically 4-colorable maximal planar graphs
• Acyclically 3-colorable planar graphs

This page was built for publication: Acyclic coloring with few division vertices

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