The remarks on the four colors problem
Keywords:
Four colors problem
Abstract
In this note we are proving the four conjecture for planar graphs. The proof follows the Euler Indentity for planar graphs.
Downloads
Download data is not yet available.
References
[1] Arthur Benjamin, Gary Chartrand, Ping Zhung, The fascinating word of graph theory, Princeton University Press, 2015.
[2] en. wikipedia.org/wiki/four color theorem.
[2] en. wikipedia.org/wiki/four color theorem.
Published
2021-06-15
How to Cite
Czopik, J. (2021). The remarks on the four colors problem. Journal of Progressive Research in Mathematics, 18(2), 59-60. Retrieved from http://scitecresearch.com/journals/index.php/jprm/article/view/2030
Issue
Section
Articles
Copyright (c) 2021 Journal of Progressive Research in Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
