Adjacent strong edge colorings and total colorings of regular graphs

被引：3
|
作者：
Zhang ZhongFu [1 ,2 ]
Woodall, Douglas R. [3 ]
Yao Bing [2 ]
Li JingWen [1 ]
Chen XiangEn [2 ]
Bian Liang [4 ]
机构：
[1] Lanzhou Jiaotong Univ, Inst Appl Math, Lanzhou 730070, Peoples R China
[2] NW Normal Univ, Coll Math & Informat Sci, Lanzhou 730070, Peoples R China
[3] Univ Nottingham, Sch Math Sci, Nottingham NG7 2RD, England
[4] Qufu Normal Univ, Sch Math Sci, Qufu 273165, Peoples R China
来源：
SCIENCE IN CHINA SERIES A-MATHEMATICS | 2009年 / 52卷 / 05期
基金：
中国国家自然科学基金;
关键词：
graph; total coloring; adjacent strong edge coloring; TOTAL CHROMATIC NUMBER;
D O I：
10.1007/s11425-008-0153-5
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
It is conjectured that. chi'(as)(G) = chi(t)(G) for every k-regular graph G with no C-5 component (k >= 2). This conjecture is shown to be true for many classes of graphs, including: graphs of type 1; 2-regular, 3-regular and (vertical bar V(G)vertical bar - 2)-regular graphs; bipartite graphs; balanced complete multipartite graphs; k-cubes; and joins of two matchings or cycles.
引用
收藏
页码：973 / 980
页数：8
相关论文
共 50 条
  • [41] EDGE-COLORINGS OF GRAPHS
    ANDERSEN, LD
    MATHEMATICA SCANDINAVICA, 1977, 40 (02) : 161 - 175
  • [42] Maximal edge colorings of graphs
    Babinski, Sebastian
    Grzesik, Andrzej
    EUROPEAN JOURNAL OF COMBINATORICS, 2024, 117
  • [43] Resolving edge colorings in graphs
    Chartrand, G
    Saenpholphat, V
    Zhang, P
    ARS COMBINATORIA, 2005, 74 : 33 - 47
  • [44] Total colorings of some classes of four regular circulant graphs
    Navaneeth, R.
    Geetha, J.
    Somasundaram, K.
    Fu, Hung-Lin
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2024, 21 (01) : 1 - 3
  • [45] Between proper and strong edge-colorings of subcubic graphs
    Hocquard, Herve
    Lajou, Dimitri
    Luzar, Borut
    JOURNAL OF GRAPH THEORY, 2022, 101 (04) : 686 - 716
  • [46] Strong edge-colorings of planar graphs with small girth
    Guo, Yirong
    Zhang, Xia
    Zhang, Xinmiao
    APPLIED MATHEMATICS AND COMPUTATION, 2021, 394
  • [47] Between Proper and Strong Edge-Colorings of Subcubic Graphs
    Hocquard, Herve
    Lajou, Dimitri
    Luzar, Borut
    COMBINATORIAL ALGORITHMS, IWOCA 2020, 2020, 12126 : 355 - 367
  • [48] Strong edge-colorings for k-degenerate graphs
    Yu, Gexin
    GRAPHS AND COMBINATORICS, 2015, 31 (05) : 1815 - 1818
  • [49] On edge colorings of 1-planar graphs without adjacent triangles
    Zhang, Xin
    Liu, Guizhen
    INFORMATION PROCESSING LETTERS, 2012, 112 (04) : 138 - 142
  • [50] Total colorings of circulant graphs
    Geetha, J.
    Somasundaram, K.
    Fu, Hung-Lin
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2021, 13 (05)
12345