Acyclic coloring of graphs with maximum degree five
Résumé
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]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...