Total Coloring of Planar Graphs Without Some Chordal 6-cycles

被引：8
|
作者：
Xu, Renyu [1 ]
Wu, Jianliang [1 ]
Wang, Huijuan [1 ]
机构：
[1] Shandong Univ, Sch Math, Jinan 250100, Peoples R China
来源：
BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY | 2015年 / 38卷 / 02期
关键词：
Planar graph; Total coloring; Cycle; TOTAL CHROMATIC NUMBER; MAXIMUM DEGREE;
D O I：
10.1007/s40840-014-0036-6
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A k-total-coloring of a graph G is a coloring of vertex set and edge set using k colors such that no two adjacent or incident elements receive the same color. In this paper, we prove that if G is a planar graph with maximum Delta >= 8 and every 6-cycle of G contains at most one chord or any chordal 6-cycles are not adjacent, then G has a ( Delta + 1)-total-coloring.
引用
收藏
页码：561 / 569
页数：9
相关论文
共 50 条
  • [41] The 2-surviving rate of planar graphs without 6-cycles
    Wang, Weifan
    Finbow, Stephen
    Kong, Jiangxu
    THEORETICAL COMPUTER SCIENCE, 2014, 518 : 22 - 31
  • [42] Linear Coloring of Planar Graphs Without 4-Cycles
    Wang, Weifan
    Wang, Yiqiao
    GRAPHS AND COMBINATORICS, 2013, 29 (04) : 1113 - 1124
  • [43] Linear Coloring of Planar Graphs Without 4-Cycles
    Weifan Wang
    Yiqiao Wang
    Graphs and Combinatorics, 2013, 29 : 1113 - 1124
  • [44] The Linear Arboricity of Planar Graphs without chordal short cycles
    Wang, Hui-Juan
    Liu, Bin
    Wu, Jian-Liang
    UTILITAS MATHEMATICA, 2012, 87 : 255 - 263
  • [45] Partitioning Planar Graphs without 4-Cycles and 6-Cycles into a Linear Forest and a Forest
    Huang, Xiaojie
    Huang, Ziwen
    Lv, Jian-Bo
    GRAPHS AND COMBINATORICS, 2023, 39 (01)
  • [46] List vertex arboricity of planar graphs without 5-cycles intersecting with 6-cycles
    Yang, Yanping
    Wang, Yang
    Liu, Juan
    AIMS MATHEMATICS, 2021, 6 (09): : 9757 - 9769
  • [47] Total colorings and list total colorings of planar graphs without intersecting 4-cycles
    Liu, Bin
    Hou, Jianfeng
    Wu, Jianliang
    Liu, Guizhen
    DISCRETE MATHEMATICS, 2009, 309 (20) : 6035 - 6043
  • [48] Acyclic edge coloring of planar graphs without 4-cycles
    Weifan Wang
    Qiaojun Shu
    Yiqiao Wang
    Journal of Combinatorial Optimization, 2013, 25 : 562 - 586
  • [49] Total coloring of planar graphs with 7-cycles containing at most two chords
    Xu, Renyu
    Wu, Jian-Liang
    THEORETICAL COMPUTER SCIENCE, 2014, 520 : 124 - 129
  • [50] Partitioning Planar Graphs without 4-Cycles and 6-Cycles into a Linear Forest and a Forest
    Xiaojie Huang
    Ziwen Huang
    Jian-Bo Lv
    Graphs and Combinatorics, 2023, 39
12345