Hits :

First Author : Wang, Yiqiao

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

Date of Publication : 2014-01-01

Document Type : 期刊

Journal : SIAM journal on discrete mathematics

Volume: Vol.28

Issue : No.4

ISSN : 0895-4801

Translation or Not : no

Key Words : plane graph;entire coloring;maximum degree

Abstract : A plane graph G is entirely k-colorable if V(G) boolean OR E(G) boolean OR F(G) can be colored with k colors such that any two adjacent or incident elements receive different colors. In 1993, Borodin proved that every plane graph G with maximum degree tri