Acyclic colouring of 1-planar graphs

被引：46
作者：
Borodin, OV
Kostochka, AV
Raspaud, A
Sopena, E
机构：
[1] Novosibirsk State Univ, Novosibirsk 630090, Russia
[2] Sobolev Inst Math, Novosibirsk 630090, Russia
[3] Univ Bordeaux 1, LaBRI, F-33405 Talence, France
来源：
DISCRETE APPLIED MATHEMATICS | 2001年 / 114卷 / 1-3期
关键词：
D O I：
10.1016/S0166-218X(00)00359-0
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A graph is I-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 I-planar graph is at most 20. (C) 2001 Published by Elsevier Science B.V.
引用
收藏
页码：29 / 41
页数：13
相关论文
共 15 条
12