王维凡

professor  

Gender : Male

Alma Mater : 南京大学

Education Level : Graduate student graduate

Degree : Doctorate

Status : 退休

School/Department : 数学科学学院

Date of Employment : 2002-05-01


Paper achievements

Planar graphs without 4,6,8-cycles are 3-colorable

Hits :

First Author : Weifan

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

Date of Publication : 2007-01-01

Document Type : 期刊

Journal : 中国科学(A辑)(英文版)

Issue : 第11期

Page Number : 34-44

ISSN : 1674-7283

Translation or Not : no

Key Words : planar;graphs;coloring;cycle

Abstract : In this paper we prove that every planar graph without 4,6 and 8-cycles is 3-colorable.

Pre One : Planar graphs with maximum degree 4 are strongly 19-edge-colorable

Next One : Star list chromatic number of planar subcubic graphs

Recommend this Article