A 4-Color Circular Map Coloring Method
Keywords:
map, four color, four color conjecture, graph theory
Abstract
Different vertices are colored in a plan Adjacent vertices are colored differently from nonadjacent vertices which are colored the same color One color is used for a single point two color are used for points without a loop and a maximum of four color are used for points with a loop A maximum of four color are used to color all points
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Shijun Han. (2023). A 4-Color Circular Map Coloring Method. Global Journal of Science Frontier Research, 23(F5), 1–6. Retrieved from https://journalofscience.org/index.php/GJSFR/article/view/102725
Published
2023-09-12
Issue
Section
Articles
License
Copyright (c) 2023 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.