The edge-face chromatic number xef(G) of a planar graph G is the minimal number of colors needed for coloring the edges and faces of G such that no two adjacent or incident elements receive the same color.
对平面图G的边面染色，是指对图G的每条边和每个面染上一种颜色，使得相邻的边和面染不同的颜色；边面色数X_(ef)(G)是对图G的进行边面染色的最小色数。
参考来源 - 平面图染色问题的研究·2,447,543篇论文数据，部分数据来源于NoteExpress
In this paper, Euler's formula and Handshaking lemma is used to obtain the face chromatic number of a planar graph by solving equations.
本文在前人研究的面着色问题基础上，运用欧拉公式和握手定理通过解方程组得到连通平面图的面色数。
Besides, it concretely analysized the calculation of face chromatic number of plan view on the surface of the sphere and the ring, and promoted the application of equations.
具体分析了球面和环面上平面图面色数的计算，并将方程组的应用进行推广。
应用推荐