Acyclic Coloring of Graphs of Maximum Degree $\Delta$ - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2005

Acyclic Coloring of Graphs of Maximum Degree $\Delta$

Résumé

An acyclic coloring of a graph $G$ is a coloring of its vertices such that: (i) no two neighbors in $G$ are assigned the same color and (ii) no bicolored cycle can exist in $G$. The acyclic chromatic number of $G$ is the least number of colors necessary to acyclically color $G$, and is denoted by $a(G)$. We show that any graph of maximum degree $\Delta$ has acyclic chromatic number at most $\frac{\Delta (\Delta -1) }{ 2}$ for any $\Delta \geq 5$, and we give an $O(n \Delta^2)$ algorithm to acyclically color any graph of maximum degree $\Delta$ with the above mentioned number of colors. This result is roughly two times better than the best general upper bound known so far, yielding $a(G) \leq \Delta (\Delta -1) +2$. By a deeper study of the case $\Delta =5$, we also show that any graph of maximum degree $5$ can be acyclically colored with at most $9$ colors, and give a linear time algorithm to achieve this bound.
Fichier principal
Vignette du fichier
dmAE0175.pdf (173.57 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01184439 , version 1 (14-08-2015)

Identifiants

Citer

Guillaume Fertin, André Raspaud. Acyclic Coloring of Graphs of Maximum Degree $\Delta$. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.389-396, ⟨10.46298/dmtcs.3450⟩. ⟨hal-01184439⟩
446 Consultations
953 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More