We give a more simple proof of the Map Color Theorem for nonorientable surfaces that uses only four constructions of current graphs instead of 12 constructions used in the previous proof. For every $i=0,1,2,3$, using an index one current graph with cyclic current group, we construct a nonorientable triangular embedding of $K_{12s+3i+1}$ that can be easily modified into a nonorientable triangular embedding of $K_{12s+3i+3}$ and a minimal nonorientable embedding of $K_{12s+3i+5}$. As a result, for every $n\ge 10$, $n\notin \{11,14,20\}$, we construct a minimal nonorientable embedding of $K_n$. During the modifications, all but $2(4s+i)$ faces of the nonorientable triangular embedding of $K_{12s+3i+1}$ become faces of the nonorientable triangular embedding of $K_{12s+3i+3}$, and all but $2(4s+i)+1$ faces of the nonorientable triangular embedding of $K_{12s+3i+3}$ become faces of the minimal nonorientable embedding of $K_{12s+3i+5}$.

我们为不可定向表面的地图颜色定理提供了一个更简单的证明，它仅使用当前图的四种构造，而不是之前证明中使用的 12 种构造。对于每一个$\mathrm{一世}=0,1,2,3$，使用具有循环当前组的索引一当前图，我们构造了一个不可定向的三角形嵌入${ķ}_{12s+3\mathrm{一世}+1}$可以很容易地修改为不可定向的三角形嵌入${ķ}_{12s+3\mathrm{一世}+3}$和一个最小的不可定向嵌入${ķ}_{12s+3\mathrm{一世}+5}$. 结果，对于每个$n\ge 10$,$n\notin \{11,14,20\}$，我们构造了一个最小的不可定向嵌入${ķ}_n$. 在修改过程中，除了$2(4s+\mathrm{一世})$的不可定向三角形嵌入的面${ķ}_{12s+3\mathrm{一世}+1}$成为不可定向的三角形嵌入的面${ķ}_{12s+3\mathrm{一世}+3}$, 除了$2(4s+\mathrm{一世})+1$的不可定向三角形嵌入的面${ķ}_{12s+3\mathrm{一世}+3}$成为最小不可定向嵌入的面${ķ}_{12s+3\mathrm{一世}+5}$.