Hits :

First Author : Weifan Wang

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

Document Type : 期刊

Journal : Journal of Combinatorial Optimization

Page Number : 1-19

ISSN : 1382-6905;1573-2886

Translation or Not : no

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

Abstract : The neighbor-distinguishing total coloring of a graph G is a proper total coloring of G using k colors such that any two adjacent vertices have different sets of colors. It was known that every planar graph G with \(\Delta \ge 10\) is neighbor-distinguish