Hits :

First Author : Huang, DJ

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

Date of Publication : 2012-01-01

Document Type : 期刊

Journal : ARS COMBINATORIA

Volume: Vol.107

Page Number : 379-384

ISSN : 0381-7032

Translation or Not : no

Key Words : General;neighbor-distinguishing;total;coloring;Chromatic;number;Graph

Abstract : The general neighbor-distinguishing total chromatic number chi ''(gnd) (G) of a graph G is the smallest integer k such that the vertices and edges of G can be colored by k colors so that no adjacent vertices have the same set of colors. It is proved in th