2-Distance coloring of planar graphs without triangles and intersecting 4-cycles

被引：1
|
作者：
Bu, Yuehua [1 ,2 ]
Zhang, Zewei [1 ]
Zhu, Hongguo [1 ]
机构：
[1] Zhejiang Normal Univ, Dept Math, Jinhua 321004, Zhejiang, Peoples R China
[2] Zhejiang Normal Univ, Xingzhi Coll, Jinhua 321004, Zhejiang, Peoples R China
来源：
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS | 2023年 / 15卷 / 02期
关键词：
2-Distance coloring; planar graph; girth; cycle; SQUARE; GIRTH;
D O I：
10.1142/S1793830922500847
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The k-2-distance coloring of graph G is a mapping c : V (G) ->{1, 2, ... ,k} if any two vertices at distance at most two from each other get different colors. The 2-distance chromatic number is the smallest integer k such that G has a k-2-distance coloring, denoted by chi(2)(G). In this paper, we prove that every planar graph G without 3-cycles and intersecting 4-cycles and Delta(G) >= 81 has chi(2)(G) <= Delta + 5.
引用
收藏
页数：20
相关论文
共 50 条
  • [1] 2-DISTANCE COLORING OF PLANAR GRAPHS WITHOUT 4-CYCLES AND 5-CYCLES
    Dong, Wei
    Xu, Baogang
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2019, 33 (03) : 1297 - 1312
  • [2] List 2-Distance Coloring of Planar Graphs with Neither 3-Cycles Nor Intersect 4-Cycles
    Zhou, Wen-juan
    Sun, Lei
    [J]. IAENG International Journal of Applied Mathematics, 2022, 52 (01)
  • [3] List 2-distance coloring of planar graphs without short cycles
    Bu, Yuehua
    Shang, Chunhui
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2016, 8 (01)
  • [4] List 2-distance -coloring of planar graphs without 4,5-cycles
    Zhu, Haiyang
    Gu, Yu
    Sheng, Jingjun
    Lu, Xinzhong
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 36 (04) : 1411 - 1424
  • [5] 2-Distance coloring of planar graphs without adjacent 5-cycles
    Yuehua Bu
    Zewei Zhang
    Hongguo Zhu
    [J]. Journal of Combinatorial Optimization, 2023, 45
  • [6] Equitable Δ-Coloring of Planar Graphs without 4-cycles
    Tan, Xiang
    [J]. OPERATIONS RESEARCH AND ITS APPLICATIONS, 2010, 12 : 400 - 405
  • [7] Linear Coloring of Planar Graphs Without 4-Cycles
    Wang, Weifan
    Wang, Yiqiao
    [J]. GRAPHS AND COMBINATORICS, 2013, 29 (04) : 1113 - 1124
  • [8] Linear Coloring of Planar Graphs Without 4-Cycles
    Weifan Wang
    Yiqiao Wang
    [J]. Graphs and Combinatorics, 2013, 29 : 1113 - 1124
  • [9] 2-Distance coloring of planar graphs without adjacent 5-cycles
    Bu, Yuehua
    Zhang, Zewei
    Zhu, Hongguo
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2023, 45 (05)
  • [10] Planar graphs without 4-cycles and intersecting triangles are (1,1,0)-colorable
    Li, Xiangwen
    Liu, Runrun
    Yu, Gexin
    [J]. DISCRETE APPLIED MATHEMATICS, 2021, 304 : 236 - 247
12345