Acyclic colouring of 1-planar graphs

Authors
Borodin, OV Kostochka, AV Raspaud, A Sopena, E
Citation
Ov. Borodin et al., Acyclic colouring of 1-planar graphs, DISCR APP M, 114(1-3), 2001, pp. 29-41
Citations number
15
Categorie Soggetti
Engineering Mathematics
Journal title
DISCRETE APPLIED MATHEMATICS → ACNP
Volume
114
Issue
1-3
Year of publication
2001
Pages
29 - 41
Database
ISI
SICI code
Abstract
A graph is I-planar if it can be drawn on the plane in such a way that ever y edge crosses at most one other edge. We prove that the acyclic chromatic number of every I-planar graph is at most 20. (C) 2001 Published by Elsevie r Science B.V.