Non Computer Proof of the Four Color Theorem：N-Color Theory
Sheng Qin · 2024
This paper presents a theory on graph topological structure and graph coloring, proving that for any N-order graph structure (with a topological structure similar to K_n), the maximum number of colors required for coloring is less than or equal to n. The Four Color Theorem is just one special case of this theory, with the maximum structure size for a four-color graph being a 4-order structure graph, hence requiring only a maximum of 4 colors for coloring.