标题:The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
作者:Cheng, Xiaohan; Wu, Jianliang
作者机构:[Cheng, Xiaohan] Univ Jinan, Sch Math Sci, Jinan 250022, Shandong, Peoples R China.; [Wu, Jianliang] Shandong Univ, Sch Math, Jinan 250100, Shandong 更多
通讯作者:Wu, Jianliang
通讯作者地址:[Wu, JL]Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China.
来源:JOURNAL OF COMBINATORIAL OPTIMIZATION
出版年:2018
卷:35
期:1
DOI:10.1007/s10878-017-0149-6
关键词:Adjacent vertex distinguishing total choosability; Planar graph; Maximum; degree
摘要:A (proper) total-k-coloring of a graph G is a mapping such that any two adjacent or incident elements in receive different colors. Let C(v) denote the set of the color of a vertex v and the colors of all incident edges of v. An adjacent vertex distinguishing total-k-coloring of G is a total-k-coloring of G such that for each edge , . We denote the smallest value k in such a coloring of G by . It is known that for any planar graph with . In this paper, we consider the list version of this coloring and show that if G is a planar graph with , then , where is the adjacent vertex distinguishing total choosability.
收录类别:EI;SCOPUS;SCIE
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85021721551&doi=10.1007%2fs10878-017-0149-6&partnerID=40&md5=88f54417190c6d9c277261b55ad65142
TOP