王维凡

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-colorability of planar graphs without adjacent short cycles

Hits :

First Author : YingQian Wang

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

Date of Publication : 2010-01-01

Document Type : 期刊

Journal : Science in China, Series A: Mathematics, Physics, Astronomy

Volume: Vol.53

Issue : No.4

Page Number : 1129-1132

ISSN : 1674-7283

Translation or Not : no

Key Words : planar;graph;coloring;extension;cycle

Abstract : A short cycle means a cycle of length at most 7. In this paper, we prove that planar graphs without adjacent short cycles are 3-colorable. This improves a result of Borodin et al. (2005).

Pre One : Class I graphs of nonnegative characteristic without special cycles.

Next One : 8-star-choosability of a graph with maximum average degree less than 3.

Recommend this Article