Acyclic coloring of graphs with maximum degree five

Hervé Hocquard (1) , Mickael Montassier (1)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique

An acyclic k-coloring of a graph G is a proper vertex coloring of G which uses at most k colors such that the graph induced by the union of every two color classes is a forest. In this paper, we mainly prove that every 5-connected graph with maximum degree five is acyclically 8-colorable.

Domaines: Mathématique discrète [cs.DM]

Hervé Hocquard, Mickael Montassier. Acyclic coloring of graphs with maximum degree five. 2010. ⟨hal-00375166⟩