标题:Total colorings of F-5-free planar graphs with maximum degree 8
作者:Chang, Jian; Wu, Jian-Liang; Wang, Hui-Juan; Guo, Zhan-Hai
作者机构:[Chang, Jian] Inner Mongolia Normal Univ, Math Sci Coll, Hohhot 010022, Peoples R China.; [Wu, Jian-Liang; Wang, Hui-Juan] Shandong Univ, Sch Math, 更多
通讯作者:Wu, JL
通讯作者地址:[Wu, JL]Shandong Univ, Sch Math, Jinan 250100, Peoples R China.
来源:ELECTRONIC JOURNAL OF COMBINATORICS
出版年:2014
卷:21
期:1
关键词:planar graph; total coloring; cycle
摘要:The total chromatic number of a graph C, denoted by chi '' (G), is the minimum number of colors needed to color the vertices and edges of G such that no two adjacent or incident elements get the same color. It is known that if a planar graph G has maximum degree Delta >= 9, then chi ''(G) = Delta + 1. The join K-1 V P-n of K-1 and P-n is called a fan graph F-n. In this paper, we prove that if G is an F-5-free planar graph with maximum degree 8, then chi ''(G) = 9.
收录类别:SCOPUS;SCIE
WOS核心被引频次:1
Scopus被引频次:1
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84896450405&partnerID=40&md5=7661b2c5421c29e891132bf68f0e9d69
TOP