王维凡

professor  

Gender : Male

Alma Mater : 南京大学

Education Level : Graduate student graduate

Degree : Doctorate

Status : 退休

School/Department : 数学科学学院

Date of Employment : 2002-05-01


Paper achievements

An improved bound on parity vertex colourings of outerplane graphs

Hits :

First Author : Weifan Wang

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

Date of Publication : 2012-01-01

Document Type : 期刊

Journal : Discrete Mathematics

Volume: Vol.312

Issue : No.18

Page Number : 2782-2787

ISSN : 0012-365X

Translation or Not : no

Key Words : Parity;vertex;colouring;Outerplane;graph;End;face

Abstract : A parity vertex colouring of a 2-connected plane graph G is a proper vertex colouring such that for each face f and colour i, either zero or an odd number of vertices incident with f are coloured i. The parity chromatic number χ p (G) of G is the smallest

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

Next One : The 2-surviving rate of planar graphs without 4-cycles

Recommend this Article