Hits :

First Author : Weifan Wang

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

Date of Publication : 2014-01-01

Document Type : 期刊

Journal : Journal of Combinatorial Optimization

Volume: Vol.27

Issue : No.2

Page Number : 379-396

ISSN : 1382-6905;1573-2886

Translation or Not : no

Key Words : Adjacent;vertex;distinguishing;total;coloring;Planar;graph;Maximum;degree

Abstract : An adjacent vertex distinguishing total coloring of a graph G is a proper total coloring of G such that any pair of adjacent vertices have distinct sets of colors. The minimum number of colors needed for an adjacent vertex distinguishing total coloring of