Hits :

First Author : YIQIAO WANG

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

Date of Publication : 2014-01-01

Document Type : 期刊

Journal : SIAM Journal on Discrete Mathematics

Volume: Vol.28

Issue : No.4

Page Number : 1892-1905

ISSN : 0895-4801

Translation or Not : no

Key Words : GRAPH;theory;RESEARCH;PLANAR;graphs;GRAPH;coloring;GEOMETRY;MATHEMATICS

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