Acyclic 4-choosability of Planar Graphs with Girth at Least 5
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, for a given list assignment L = L(v): v ∈ V, if 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)| ≥ κ for all v ∈ V, then G is called κ-choosable. A graph is said to be acyclically κ-choosable if these L-list colorings can be chosen to be acyclic. In this paper, we prove that if G is planar with girth g ≥ 5, then G is acyclically 4-choosable. This improves the result of Borodin, Kostochka and Woodall [[BKW99]] concerning the acyclic chromatic number of planar graphs with girth at least 5.
KeywordsPlanar Graph Proper Color Connected Planar Graph Minimum Counterexample Large Girth
Unable to display preview. Download preview PDF.
- [BKW99]O.V. Borodin, A.V. Kostochka, and D.R. Woodall. Acyclic colourings of planar graphs with large girth. J. London Math. Soc., 1999.Google Scholar
- [Kos76]A.V. Kostochka. Acyclic 6-coloring of planar graphs. Discretny analys., (28):40–56, 1976. In Russian.Google Scholar
- [MOR05]M. Montassier, P. Ochem, and A. Raspaud. On the acyclic choosability of graphs. Journal of Graph Theory, 2005. To appear.Google Scholar
- [MRW05]M. Montassier, A. Raspaud, and W. Wang. Acyclic 4-choosability of planar graphs without cycles of specific lengths. Technical report, LaBRI, 2005.Google Scholar