Hits :

First Author : Weifan Wang

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

Date of Publication : 2011-01-01

Document Type : 期刊

Journal : Journal of Combinatorial Theory. Series B

Volume: Vol.101

Issue : No.6

Page Number : 490-501

ISSN : 0095-8956

Translation or Not : no

Key Words : Entire;colouring;Plane;graph;Vertex–edge–face;colouring

Abstract : It was conjectured by Kronk and Mitchem in 1973 that simple plane graphs of maximum degree Δ are entirely (Δ+4)-colourable, i.e., the vertices, edges, and faces of a simple plane graph may be simultaneously coloured with Δ+4 colours in such a way that adj