王维凡

professor  

Gender : Male

Alma Mater : 南京大学

Education Level : Graduate student graduate

Degree : Doctorate

Status : 退休

School/Department : 数学科学学院

Date of Employment : 2002-05-01


Paper achievements

Adjacent vertex distinguishing total colorings of outerplanar graphs

Hits :

First Author : Yiqiao Wang

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

Date of Publication : 2010-01-01

Document Type : 期刊

Journal : Journal of Combinatorial Optimization

Volume: Vol.19

Issue : No.2

Page Number : 123-133

Translation or Not : no

Key Words : Adjacent;vertex;distinguishing;total;coloring;Outerplanar;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 are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing tota

Pre One : Entire colouring of plane graphs

Next One : Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree

Recommend this Article