Article
Version 1
Preserved in Portico This version is not peer-reviewed
Non Computer Proof of the Four Color Theorem: N-Color Theory
Version 1
: Received: 20 April 2024 / Approved: 21 April 2024 / Online: 22 April 2024 (16:28:06 CEST)
How to cite: Qin, S. Non Computer Proof of the Four Color Theorem: N-Color Theory. Preprints 2024, 2024041371. https://doi.org/10.20944/preprints202404.1371.v1 Qin, S. Non Computer Proof of the Four Color Theorem: N-Color Theory. Preprints 2024, 2024041371. https://doi.org/10.20944/preprints202404.1371.v1
Abstract
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 ), the maximum number of colors required for coloring is less than or equal to . 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.
Keywords
The Four Color Theorem；N-Color Theory; N-order graph structure
Subject
Computer Science and Mathematics, Geometry and Topology
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
