首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Adjacent strong edge colorings and total colorings of regular graphs
Authors:ZhongFu Zhang  Douglas R Woodall  Bing Yao  JingWen Li  XiangEn Chen  Liang Bian
Institution:(1) Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou, 730070, China;(2) College of Mathematics and Information Science, Northwest Normal University, Lanzhou, 730070, China;(3) School of Mathematical Sciences, University of Nottingham, Nottingham, NG7 2RD, UK;(4) School of Mathematical Sciences, Qufu Normal University, Qufu, 273165, China
Abstract:It is conjectured that X as(G) = X 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 (|V(G)| - 2)-regular graphs; bipartite graphs; balanced complete multipartite graphs; k-cubes; and joins of two matchings or cycles. This work was supported by National Natural Science Foundation of China (Grant No. 10771091)
Keywords:graph  total coloring  adjacent strong edge coloring
本文献已被 CNKI SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号