A 4-Color Circular Map Coloring Method

Authors

  • Shijun Han

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

How to Cite

A 4-Color Circular Map Coloring Method. (2023). Global Journal of Science Frontier Research, 23(F5), 1-6. https://journalofscience.org/index.php/GJSFR/article/view/102725

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.

A 4-Color Circular Map Coloring Method

Published

2023-09-12

How to Cite

A 4-Color Circular Map Coloring Method. (2023). Global Journal of Science Frontier Research, 23(F5), 1-6. https://journalofscience.org/index.php/GJSFR/article/view/102725