标题:Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
作者:Hu, Jie; Wang, Guanghui; Wu, Jianliang; Yang, Donglei; Yu, Xiaowei
作者机构:[Hu, Jie; Wang, Guanghui; Wu, Jianliang; Yang, Donglei] Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China.; [Yu, Xiaowei] Jiangsu Nor 更多
通讯作者:Wang, GH
通讯作者地址:[Wang, GH]Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China.
来源:DISCRETE MATHEMATICS
出版年:2019
卷:342
期:5
页码:1392-1402
DOI:10.1016/j.disc.2019.01.024
关键词:Adjacent vertex distinguishing total coloring; Planar graph; Discharging; method
摘要:Let k be a positive integer. An adjacent vertex distinguishing (for short, AVD) total-k-coloring of a graph G is a proper total-k-coloring of G such that any two adjacent vertices have different color sets, where the color set of a vertex nu contains the color of nu and the colors of its incident edges. It was conjectured that any graph with maximum degree Delta has an AVD total-(Delta+3)-coloring. The conjecture was confirmed for any graph with maximum degree at most 4 and any planar graph with maximum degree at least 10. In this paper, we verify the conjecture for all planar graphs with maximum degree at least 9. Moreover, we prove that any planar graph with maximum degree at least 10 has an AVD total-(Delta + 2)coloring and the bound Delta + 2 is sharp. (C) 2019 Elsevier B.V. All rights reserved.
收录类别:SCOPUS;SCIE
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85061436101&doi=10.1016%2fj.disc.2019.01.024&partnerID=40&md5=0c8efa9847b5c2b9bb3c3571830679e9
TOP