王维凡

professor  

Gender : Male

Alma Mater : 南京大学

Education Level : Graduate student graduate

Degree : Doctorate

Status : 退休

School/Department : 数学科学学院

Date of Employment : 2002-05-01


Paper achievements

On 3-colorable planar graphs without short cycles

Hits :

First Author : Min Chena and Weifan Wang

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

Date of Publication : 2008-01-01

Document Type : 期刊

Journal : Applied Mathematics Letters

Volume: Vol.21

Issue : No.9

Page Number : 961-965

ISSN : 0893-9659

Translation or Not : no

Key Words : Planar;graphs;Face;Coloring;Chromatic;number;Cycle

Abstract : In this paper, we prove that planar graphs without {4,6,7}-cycles and without two 5-cycles sharing exactly one edge are 3-colorable. This improves the result in [O.V. Borodin, A.N. Glebov, A. Raspaud, M.R. Salavatipour, Planar graphs without cycles o

Pre One : Vertex-arboricity of planar graphs without intersecting triangles

Next One : Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five.

Recommend this Article