Abstract
A proper vertex coloring of a graph G = (V,E) is acyclic if G contains no bicolored cycle. A graph G is L-list colorable if for a given list assignment L = {L(v) : v ∈ V}, there exists a proper coloring c of G such that c(v) ∈ L(v) for all v ∈ V. If G is L-list colorable for every list assignment with |L(v)| ≥ k for all v ∈ V, then G is said k-choosable. A graph is said to be acyclically k-choosable if the coloring obtained is acyclic. In this paper, we study the acyclic choosability of graphs with small maximum degree. In 1979, Burstein proved that every graph with maximum degree 4 admits a proper acyclic coloring using 5 colors [Bur79]. We give a simple proof that (a) every graph with maximum degree Δ = 3 is acyclically 4-choosable and we prove that (b) every graph with maximum degree Δ = 4 is acyclically 5-choosable. The proof of (b) uses a backtracking greedy algorithm and Burstein’s theorem.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albertson, M.O., Berman, D.M.: Every planar graph has an acyclic 7-coloring. Israel J. Math. (28), 169–174 (1977)
Borodin, O.V., Fon-Der Flaass, D.G., Kostochka, A.V., Raspaud, A., Sopena, E.: Acyclic list 7-coloring of planar graphs. J. Graph Theory 40(2), 83–90 (2002)
Borodin, O.V., Kostochka, A.V., Woodall, D.R.: Acyclic colourings of planar graphs with large girth. J. London Math. Soc. 2(60), 344–352 (1999)
Borodin, O.V.: On acyclic coloring of planar graphs. Discrete Math. 25, 211–236 (1979)
Burstein, M.I.: Every 4-valent graph has an acyclic 5-colouring. Bulletin of the Academy of Sciences of the Georgian SSR 93(1), 21–24 (1979) (In Russian)
Grünbaum, B.: Acyclic colorings of planar graphs. Israel J. Math. 14, 390–408 (1973)
Kostochka, A.V., Mel’nikov, L.S.: Note to the paper of Grünbaum on acyclic colorings. Discrete Math. 14, 403–406 (1976)
Kostochka, A.V.: Acyclic 6-coloring of planar graphs. Metody Diskret. Anal. (28), 40–56 (1976) (In Russian)
Kostochka, A.V.: Upper bounds of chromatic functions of graphs. PhD thesis, Novosibirsk (1978)
Mitchem, J.: Every planar graph has an acyclic 8-coloring. Duke Math. J. 41, 177–181 (1974)
Montassier, M., Ochem, P., Raspaud, A.: On the acyclic choosability of graphs. Journal of Graph Theory (2005) (to appear)
Montassier, M., Serra, O.: Acyclic choosability and probabilistic methods. Technical report, Manuscript (2004)
Ochem, P.: Negative results on acyclic improper colorings Manuscript (2005)
Thomassen, C.: Every planar graph is 5-choosable. J. Combin. Theory Ser. B 62, 180–181 (1994)
Voigt, M.: List colourings of planar graphs. Discrete Math. 120, 215–219 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gonçalves, D., Montassier, M. (2005). Acyclic Choosability of Graphs with Small Maximum Degree. In: Kratsch, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2005. Lecture Notes in Computer Science, vol 3787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11604686_21
Download citation
DOI: https://doi.org/10.1007/11604686_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31000-6
Online ISBN: 978-3-540-31468-4
eBook Packages: Computer ScienceComputer Science (R0)