scientific article

zbMath1192.05049MaRDI QIDQ3576724

Guillaume Fertin, Andre Raspaud

Publication date: 30 July 2010

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAE0175/0.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

acyclic chromatic numbermaximum degreeacyclic coloring algorithm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Acyclic choosability of graphs with bounded degree ⋮ Acyclic coloring of graphs with maximum degree 7 ⋮ Acyclic vertex coloring of graphs of maximum degree 5 ⋮ Acyclic Vertex Coloring of Graphs of Maximum Degree Six ⋮ The \(r\)-acyclic chromatic number of planar graphs

This page was built for publication: