王维凡

professor  

Gender : Male

Alma Mater : 南京大学

Education Level : Graduate student graduate

Degree : Doctorate

Status : 退休

School/Department : 数学科学学院

Date of Employment : 2002-05-01


Paper achievements

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

Hits :

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

Date of Publication : 2002-01-01

Document Type : 期刊

Journal : Discrete Mathematics

Volume: Vol.253

Issue : NO.1

Page Number : 87-95

ISSN : 0012-365X

Translation or Not : no

Key Words : Plane;graph;Edge-face;coloring

Abstract : In 1975, Melnikov conjectured that the edges and faces of each plane graph G may be colored with Δ(G)+3 colors so that any two adjacent or incident elements receive different colors, where Δ(G) is the maximum degree of G. Two similar, yet independent, pro

Pre One : Choosability and edge choosability of planar graphs without five cycles

Next One : Edge-partitions of planar graphs and their game coloring numbers

Recommend this Article