共 50 条
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
来源:
基金:
中国国家自然科学基金;
关键词:
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
相关论文