关于四色定理的经典证明
Towards a classical proof of the 4-colour theorem
AI总结：
本文提出了一种基于归纳法的构造性方法，用于解决四色定理中最小度数等于5的着色问题。
摘要：
通过图的阶数进行归纳，可以轻松地对最小度数小于5的三角剖分子集进行着色，而当最小度数等于5时，无法通过重新着色单个5度顶点的邻居来完成着色。新的策略不是尝试着色至少包含5度顶点的适当子图，而是利用归纳法已提供的着色信息进行构造性使用。
英文摘要：
It is easy to colour the subset of triangulations with minimum degree less than 5 by induction on the graph order n, whereas the case with minimum degree equal to 5 cannot be coloured by recolouring the neighbours of a single 5-valent vertex. Instead of trying to colour appropriate subgraphs composed of at least 5-valent vertices, the new strategy is to use the colouring information already provided by induction in a constructive way.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
