A 4-Color Circular Map Coloring Method
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
References
Shijun Han (2023) A Map Coloring Method. 11(04), 1200-1208.
S Han (2020) Four Color Conjecture, Happy World,2020-A-00021917.
S Han (2022) Using the Triangle Method for Map Coloring, The All Committee Meeting of the Professional Committee of Combinatorial Mathematics and Graph Theory of the Chinese Mathematical Society and the Tenth National Congress of Combinatorial Mathematics and Graph Theory.
S Han (2003) Four Color Conjecture. 11, 140.
Published
2023-09-12
Issue
Section
License
Copyright (c) 2023 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.