Acyclic list 7-coloring of planar graphs

Authors:
O. V. Borodin;D. G. Fon-Der Flaass;A. V. Kostochka;A. Raspaud;E. Sopena
Affiliations:
University of Novosibirsk, Novosibirsk, 630090, Russia;Institute of Mathematics, Novosibirsk, 630090, Russia;Institute of Mathematics, Novosibirsk, 630090, Russia and Department of Mathematics, University of Illinois, Urbana, IL 61801;LaBRI, Université Bordeaux I, 33405 Talence Cedex, France;LaBRI, Université Bordeaux I, 33405 Talence Cedex, France
Venue:
Journal of Graph Theory
Year:
2002

Citing 0
Cited 8

Acyclic colorings of subcubic graphs

Information Processing Letters
Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable

Information Processing Letters
Acyclic colorings of subcubic graphs

Information Processing Letters
Note: A note on the acyclic 3-choosability of some planar graphs

Discrete Applied Mathematics
Acyclic choosability of graphs with small maximum degree

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
A Sufficient Condition for Planar Graphs

Journal of Graph Theory
A polyhedral study of the acyclic coloring problem

Discrete Applied Mathematics
Planar graphs without 4- and 5-cycles are acyclically 4-choosable

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The acyclic list chromatic number of every planar graph is proved to be at most 7. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 83–90, 2002