Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4664582 | Acta Mathematica Scientia | 2006 | 6 Pages |
Abstract
The edge-face chromatic number χef(G) of a plane graph G is the least number of colors assigned to the edges and faces such that every adjacent or incident pair of them receives different colors. In this article, the authors prove that every 2-connected plane graph G with Δ(G)≥∣G∣ − 2 ≥ 9 has χef(G) = Δ(G).
Related Topics
Physical Sciences and Engineering
Mathematics
Mathematics (General)