Hits :

First Author : Chen, Min

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

Date of Publication : 2014-01-01

Document Type : 期刊

Journal : Graphs and Combinatorics

Volume: Vol.30

Issue : No.4

Page Number : 861-874

ISSN : 0911-0119

Translation or Not : no

Key Words : Discharging;Edge-face;coloring;Maximum;degree;Plane;graph

Abstract : A plane graph G is edge-face k-colorable if the elements of $${E(G) \cup F(G)}$$ can be colored with k colors so that any two adjacent or incident elements receive different colors. Sanders and Zhao conjectured that every plane graph with maximum degree Δ