@article{862c9b78a53c420687ed22e5adaa02e4,
title = "Acyclic list 7-coloring of planar graphs",
abstract = "The acyclic list chromatic number of every planar graph is proved to be at most 7.",
keywords = "Acyclic coloring, Chromatic number, List coloring, Planar graphs",
author = "Borodin, {O. V.} and {Fon-Der Flaass}, {D. G.} and Kostochka, {A. V.} and A. Raspaud and E. Sopena",
note = "Funding Information: Russian Foundation for Basic Research (to O. V. B.); Contract grant numbers: INTAS 97-1001 and 00-01-00916; Contract grant sponsor: Dutch-Russian Grant (to D. G. F.-D. F.); Contract grant number: NWO-047-008-006; Contract grant sponsor: Russian Foundation for Basic Research (to D. G. F.-D. F.); Contract grant number: 99-01-00581; Contract grant sponsor: Universities of Russia-Fundamental Research Program, (to A. V. K.); Contract grant number: 1792; Contract grant sponsor: NATO Collaborative Research Grant (to A. R. and E. S.); Contract grant number: n? 97-1519. Publisher Copyright: {\textcopyright} 2002 Wiley Periodicals, Inc.",
year = "2002",
month = jun,
doi = "10.1002/jgt.10035",
language = "English (US)",
volume = "40",
pages = "83--90",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "2",
}