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
相关论文
共 50 条
  • [41] The stub resolution of 1-planar graphs
    Kaufmann, Michael
    Kratochvíl, Jan
    Lipp, Fabian
    Montecchiani, Fabrizio
    Raftopoulou, Chrysanthi
    Valtr, Pavel
    Journal of Graph Algorithms and Applications, 2021, 25 (02) : 625 - 642
  • [42] Cops and Robbers on 1-Planar Graphs
    Durocher, Stephane
    Kamali, Shahin
    Kryven, Myroslav
    Liu, Fengyi
    Mashghdoust, Amirhossein
    Miller, Avery
    Nezhad, Pouria Zamani
    Costa, Ikaro Penha
    Zapp, Timothy
    GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2023, PT II, 2023, 14466 : 3 - 17
  • [43] On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs
    Hu, Dai-Qiang
    Wu, Jian-Liang
    Yang, Donglei
    Zhang, Xin
    GRAPHS AND COMBINATORICS, 2017, 33 (04) : 945 - 953
  • [44] On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs
    Dai-Qiang Hu
    Jian-Liang Wu
    Donglei Yang
    Xin Zhang
    Graphs and Combinatorics, 2017, 33 : 945 - 953
  • [45] On list (p, 1)-total labellings of special planar graphs and 1-planar graphs
    Lin Sun
    Guanglong Yu
    Jianliang Wu
    Journal of Combinatorial Optimization, 2024, 47
  • [46] The Matching Extendability of Optimal 1-Planar Graphs
    Fujisawa, Jun
    Segawa, Keita
    Suzuki, Yusuke
    GRAPHS AND COMBINATORICS, 2018, 34 (05) : 1089 - 1099
  • [47] The Book Thickness of 1-Planar Graphs is Constant
    Bekos, Michael A.
    Bruckdorfer, Till
    Kaufmann, Michael
    Raftopoulou, Chrysanthi N.
    ALGORITHMICA, 2017, 79 (02) : 444 - 465
  • [48] A note on the surviving rate of 1-planar graphs
    Kong, Jiangxu
    Zhang, Lianzhu
    DISCRETE MATHEMATICS, 2017, 340 (05) : 1074 - 1079
  • [49] On list (p, 1)-total labellings of special planar graphs and 1-planar graphs
    Sun, Lin
    Yu, Guanglong
    Wu, Jianliang
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 47 (03)
  • [50] A note on total colorings of 1-planar graphs
    Czap, Julius
    INFORMATION PROCESSING LETTERS, 2013, 113 (14-16) : 516 - 517
12345