Hits :

First Author : Jingjing Huo

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2018-01-01

Document Type : 期刊

Journal : Discrete Mathematics

Volume: Vol.341

Issue : No.11

Page Number : 3044-3056

ISSN : 0012-365X

Translation or Not : no

Key Words : Planar;graph;Neighbor-distinguishing;total;coloring;Discharging;Combinatorial;Nullstellensatz

Abstract : The neighbor-distinguishing total chromatic number χ a ′ ′ ( G ) of a graph G is the smallest integer k such that G can be totally colored using k colors with a condition that any two adjacent vertices have different sets of colors. In this paper, we give