Hits :

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

Date of Publication : 2001-01-01

Document Type : 期刊

Journal : 数学物理学报(英文版)

Volume: 第21卷

Issue : 第2期

Page Number : 243-248

ISSN : 0252-9602

Translation or Not : no

Key Words : Plane；graph；chromatic；number；coloring

Abstract : Melnikov(1975) conjectured that the edges and faces of a plane graph G can be colored with △(G) + 3 colors so that any two adjacent or incident elements receive distinct colors, where △(G) denotes the maximum degree of G. This paper proves theconjecture f