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 条
  • [1] Adjacent strong edge colorings and total colorings of regular graphs
    WOODALL Douglas R
    ScienceinChina(SeriesA:Mathematics), 2009, 52 (05) : 973 - 980
  • [2] Adjacent strong edge colorings and total colorings of regular graphs
    ZhongFu Zhang
    Douglas R. Woodall
    Bing Yao
    JingWen Li
    XiangEn Chen
    Liang Bian
    Science in China Series A: Mathematics, 2009, 52 : 973 - 980
  • [3] Adjacent strong edge colorings and total colorings of regular graphs
    WOODALL Douglas R
    Science China Mathematics, 2009, (05) : 973 - 980
  • [4] On The Adjacent Strong Edge Colorings of 3-Regular Halin Graphs
    Liu Linzhong (Dept. of Transportion Management
    新疆大学学报(自然科学版), 1998, (04) : 3 - 5
  • [5] Strong edge colorings of graphs
    Favaron, O
    Li, H
    Schelp, RH
    DISCRETE MATHEMATICS, 1996, 159 (1-3) : 103 - 109
  • [6] Strong edge colorings of graphs
    Discrete Math, 1-3 (103):
  • [7] Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs
    Tian, Shuangliang
    Wang, Qian
    DISCRETE APPLIED MATHEMATICS, 2015, 185 : 220 - 226
  • [8] ADJACENT VERTEX DISTINGUISHING EDGE-COLORINGS AND TOTAL-COLORINGS OF THE CARTESIAN PRODUCT OF GRAPHS
    Tian, Shuangliang
    Chen, Ping
    Shao, Yabin
    Wang, Qian
    NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION, 2014, 4 (01): : 49 - 58
  • [9] Strong edge colorings of uniform graphs
    Czygrinow, A
    Nagle, B
    DISCRETE MATHEMATICS, 2004, 286 (03) : 219 - 223
  • [10] INCIDENCE AND STRONG EDGE COLORINGS OF GRAPHS
    BRUALDI, RA
    MASSEY, JJQ
    DISCRETE MATHEMATICS, 1993, 122 (1-3) : 51 - 58
12345