Acyclic colouring of 1-planar graphs

O. V. Borodin, A. V. Kostochka, A. Raspaud, E. Sopena

Research output: Contribution to journalArticlepeer-review


A graph is 1-planar if it can be drawn on the plane in such a way that every edge crosses at most one other edge. We prove that the acyclic chromatic number of every 1-planar graph is at most 20.

Original languageEnglish (US)
Pages (from-to)29-41
Number of pages13
JournalDiscrete Applied Mathematics
Issue number1-3
StatePublished - Oct 30 2001
Externally publishedYes

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Acyclic colouring of 1-planar graphs'. Together they form a unique fingerprint.

Cite this