Acyclic list 7-coloring of planar graphs

O. V. Borodin, D. G. Fon-Der Flaass, A. V. Kostochka, A. Raspaud, E. Sopena

Research output: Contribution to journalArticlepeer-review

Abstract

The acyclic list chromatic number of every planar graph is proved to be at most 7.

Original languageEnglish (US)
Pages (from-to)83-90
Number of pages8
JournalJournal of Graph Theory
Volume40
Issue number2
DOIs
StatePublished - Jun 2002

Keywords

  • Acyclic coloring
  • Chromatic number
  • List coloring
  • Planar graphs

ASJC Scopus subject areas

  • Geometry and Topology

Fingerprint Dive into the research topics of 'Acyclic list 7-coloring of planar graphs'. Together they form a unique fingerprint.

Cite this