张忠辅; 王维凡; 李敬文; 姚兵; 卜月华
Zhang Zhongfu; Wang Weifan; Li Jingwen; Yao Bing; Bu Yuehua
摘要:
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).
中图分类号: