Paper
22 April 2022 Standardized formulation and proof of four-colour problem
Author Affiliations +
Proceedings Volume 12163, International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2021); 121633O (2022) https://doi.org/10.1117/12.2627639
Event: International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2021), 2021, Nanjing, China
Abstract
The four-colour problem came from the practice of drawing maps. It was called the four-color conjecture before it is proved. This paper, attempts to simplify this problem to some extent and gives a simplified proof. Finally, the expected results are obtained. In the process, two theorems which can be used to simplify vertex colouring problems are also obtained.
© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Xiaobo Cai "Standardized formulation and proof of four-colour problem", Proc. SPIE 12163, International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2021), 121633O (22 April 2022); https://doi.org/10.1117/12.2627639
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Algorithms

Basic research

Computer science

Mathematics

RELATED CONTENT

Quantum hidden subgroup algorithms The devil is in the...
Proceedings of SPIE (August 24 2004)
Some fast Toeplitz least-squares algorithms
Proceedings of SPIE (December 01 1991)
Topological quantum computing and the Jones polynomial
Proceedings of SPIE (May 12 2006)
Parallel QR Decomposition Of Toeplitz Matrices
Proceedings of SPIE (April 04 1986)
Cross Hilbert time-frequency distributions
Proceedings of SPIE (October 02 1998)

Back to Top