王维凡

professor  

Gender : Male

Alma Mater : 南京大学

Education Level : Graduate student graduate

Degree : Doctorate

Status : 退休

School/Department : 数学科学学院

Date of Employment : 2002-05-01


Paper achievements

Choosability and edge choosability of planar graphs without five cycles

Hits :

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

Date of Publication : 2002-01-01

Document Type : 期刊

Journal : Applied Mathematics Letters

Volume: Vol.15

Issue : NO.5

Page Number : 561-565

ISSN : 0893-9659

Translation or Not : no

Key Words : Choosability;Edge;choosability;Degeneracy;Planar;graph.

Abstract : It is proved that a planar graph G without five cycles is three degenerate, hence, four choosable, and it is also edge-(Delta(G)+1)-choosable.

Pre One : The total chromatic number of pseudo-outerplanar graphs

Next One : A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs

Recommend this Article