标题:Total colorings of planar graphs with maximum degree seven and without 3-cycles adjacent to 4-cycles
作者:Wang, Bing ;Wu, Jian-Liang
通讯作者:Wang, B
作者机构:[Wang, Bing ] Department of Mathematics, Zaozhuang University, Zaozhuang, Shandong, China;[Wu, Jian-Liang ] School of Mathematics, Shandong University 更多
会议名称:2011 International Conference on Internet Technology and Applications, iTAP 2011
会议日期:16 August 2011 through 18 August 2011
来源:2011 International Conference on Internet Technology and Applications, iTAP 2011 - Proceedings
出版年:2011
DOI:10.1109/ITAP.2011.6006204
关键词:Cycle; Planar graph; Total coloring
摘要:Let G be a planar graph with maximum degree Δ > 7 and without 3-cycles adjacent to 4-cycles, that is, any 3-cycle has not a common edge with a 4-cycle. Then the total chromatic number of G is (Δ+1). © 2011 IEEE.
收录类别:EI;SCOPUS
资源类型:会议论文;期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-80052868969&doi=10.1109%2fITAP.2011.6006204&partnerID=40&md5=df8233d7d0651cdbc28d0d6ba53221ae
TOP