Equitable total coloring of graphs with maximum degree 3

被引：45
|
作者：
Wang, WF [1 ]
机构：
[1] Zhejiang Normal Univ, Dept Math, Jinhua 321004, Zhejiang, Peoples R China
来源：
GRAPHS AND COMBINATORICS | 2002年 / 18卷 / 03期
关键词：
Maximum Degree; Chromatic Number; Small Integer; Total Coloring; Color Classis;
D O I：
10.1007/s003730200051
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The equitable total chromatic number chi(e)(")(G) of a graph G is the smallest integer k for which G has a total k-coloring such that the number of vertices and edges in any two color classes differ by at most one. We prove in this paper that chi(e)"(G) less than or equal to 5 if G is a multigraph with maximum degree at most 3.
引用
收藏
页码：677 / 685
页数：9
相关论文
共 50 条
  • [1] Equitable Total Coloring of Graphs with Maximum Degree 3
    Wei-Fan Wang
    [J]. Graphs and Combinatorics, 2002, 18 : 677 - 685
  • [2] Equitable list-coloring for graphs for maximum Degree 3
    Pelsmajer, MJ
    [J]. JOURNAL OF GRAPH THEORY, 2004, 47 (01) : 1 - 8
  • [3] EQUITABLE COLORING AND EQUITABLE CHOOSABILITY OF GRAPHS WITH SMALL MAXIMUM AVERAGE DEGREE
    Dong, Aijun
    Zhang, Xin
    [J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (03) : 829 - 839
  • [4] Equitable coloring of planar graphs with maximum degree at least eight
    Kostochka, Alexandr
    Lin, Duo
    Xiang, Zimu
    [J]. DISCRETE MATHEMATICS, 2024, 347 (06)
  • [5] EQUITABLE COLORING AND THE MAXIMUM DEGREE
    CHEN, BL
    LIH, KW
    WU, PL
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 1994, 15 (05) : 443 - 447
  • [6] Total coloring of planar graphs of maximum degree eight
    Roussel, Nicolas
    Zhu, Xuding
    [J]. INFORMATION PROCESSING LETTERS, 2010, 110 (8-9) : 321 - 324
  • [7] Total coloring of planar graphs with maximum degree 8
    Wang, Huijuan
    Wu, Lidong
    Wu, Jianliang
    [J]. THEORETICAL COMPUTER SCIENCE, 2014, 522 : 54 - 61
  • [8] Total coloring of planar graphs with maximum degree 7
    Wang, Bing
    Wu, Jian-Liang
    [J]. INFORMATION PROCESSING LETTERS, 2011, 111 (20) : 1019 - 1021
  • [9] Total coloring of embedded graphs of maximum degree at least ten
    JianFeng Hou
    JianLiang Wu
    GuiZhen Liu
    Bin Liu
    [J]. Science China Mathematics, 2010, 53 : 2127 - 2133
  • [10] Minimum total coloring of planar graphs with maximum degree 8
    Wang, Liting
    Wang, Huijuan
    Wu, Weili
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2023, 45 (02)
12345