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.
机构:
Jiangxi Sci & Technol Normal Univ, Sch Math & Comp Sci, Nanchang, Jiangxi, Peoples R ChinaJiangxi Sci & Technol Normal Univ, Sch Math & Comp Sci, Nanchang, Jiangxi, Peoples R China
Liu, Juan
Wang, Yiqiao
论文数: 0引用数: 0
h-index: 0
机构:
Beijing Univ Chinese Med, Sch Management, Beijing, Peoples R ChinaJiangxi Sci & Technol Normal Univ, Sch Math & Comp Sci, Nanchang, Jiangxi, Peoples R China
Wang, Yiqiao
Wang, Weifan
论文数: 0引用数: 0
h-index: 0
机构:
Zhejiang Normal Univ, Dept Math, Jinhua 321004, Zhejiang, Peoples R ChinaJiangxi Sci & Technol Normal Univ, Sch Math & Comp Sci, Nanchang, Jiangxi, Peoples R China