Title of article :
Acyclic colouring of 1-planar graphs Original Research Article
Author/Authors :
O.V. Borodin، نويسنده , , A.V. Kostochka، نويسنده , , A. Raspaud، نويسنده , , E. Sopena، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
Abstract :
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.
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
