Incidence coloring of graphs with high maximum average degree

被引：0
|
作者：
Bonamy, Marthe [1 ]
Hocquard, Hervé [2 ]
Kerdjoudj, Samia [3 ]
Raspaud, André [2 ]
机构：
[1] Université Montpellier 2 - LIRMM 161 rue Ada 34095 Montpellier, France
[2] LaBRI (Université de Bordeaux), 351 cours de la Libération, Talence Cedex,33405, France
[3] LIFORCE, Faculty of Mathematics, USTHB, BP 32 El-Alia, Bab-Ezzouar 16111, Algiers, Algeria
来源：
Discrete Applied Mathematics | 2017年 / 227卷
关键词：
741.1 Light/Optics - 802.3 Chemical Operations - 921.4 Combinatorial Mathematics; Includes Graph Theory; Set Theory;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
9
引用
收藏
页码：29 / 43
相关论文
共 50 条
  • [1] Incidence coloring of graphs with high maximum average degree
    Bonamy, Marthe
    Hocquard, Herve
    Kerdjoudj, Samia
    Raspaud, Andre
    DISCRETE APPLIED MATHEMATICS, 2017, 227 : 29 - 43
  • [2] On incidence coloring for some graphs of maximum degree 4
    Fahimi, Hamed
    Omoomi, Behnaz
    ARS COMBINATORIA, 2016, 125 : 33 - 45
  • [3] The incidence coloring conjecture for graphs of maximum degree 3
    Maydanskiy, M
    DISCRETE MATHEMATICS, 2005, 292 (1-3) : 131 - 141
  • [4] EQUITABLE COLORING AND EQUITABLE CHOOSABILITY OF GRAPHS WITH SMALL MAXIMUM AVERAGE DEGREE
    Dong, Aijun
    Zhang, Xin
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (03) : 829 - 839
  • [5] Maximum average degree and relaxed coloring
    Kopreski, Michael
    Yu, Gexin
    DISCRETE MATHEMATICS, 2017, 340 (10) : 2528 - 2530
  • [6] Coloring the square of graphs whose maximum average degree is less than 4
    Kim, Seog-Jin
    Park, Boram
    DISCRETE MATHEMATICS, 2016, 339 (04) : 1251 - 1260
  • [7] List r-dynamic coloring of graphs with small maximum average degree
    Zhu, Junlei
    Bu, Yuehua
    DISCRETE APPLIED MATHEMATICS, 2019, 258 : 254 - 263
  • [8] List 3-dynamic coloring of graphs with small maximum average degree
    Kim, Seog-Jin
    Park, Boram
    DISCRETE MATHEMATICS, 2018, 341 (05) : 1406 - 1418
  • [9] On equitable Δ-coloring of graphs with low average degree
    Kostochka, A
    Nakprasit, K
    THEORETICAL COMPUTER SCIENCE, 2005, 349 (01) : 82 - 91
  • [10] On r-hued coloring of graphs with maximum average degree less than 3
    Song, Huimin
    Lai, Hong-Jian
    Wu, Jianliang
    ARS COMBINATORIA, 2020, 148 : 255 - 277
12345