DOI QR코드

DOI QR Code

The Four Color Algorithm

4-색 알고리즘

  • Lee, Sang-Un (Dept. of Multimedia Eng., Gangneung-Wonju National University)
  • 이상운 (강릉원주대학교 멀티미디어공학과)
  • Received : 2013.01.07
  • Accepted : 2013.03.26
  • Published : 2013.05.31

Abstract

This paper proposes an algorithm that proves an NP-complete 4-color theorem by employing a linear time complexity where $O(n)$. The proposed algorithm accurately halves the vertex set V of the graph $G=(V_1,E_1)$ into the Maximum Independent Set (MIS) $\bar{C_1}$ and the Minimum Vertex Cover Set $C_1$. It then assigns the first color to $\bar{C_1}$ and the second to $\bar{C_2}$, which, along with $C_2$, is halved from the connected graph $G=(V_2,E_2)$, a reduced set of the remaining vertices. Subsequently, the third color is assigned to $\bar{C_3}$, which, along with $C_3$, is halved from the connected graph $G=(V_3,E_3)$, a further reduced set of the remaining vertices. Lastly, denoting $C_3$ as $\bar{C_4}$, the algorithm assigns the forth color to $\bar{C_4}$. The algorithm has successfully obtained the chromatic number ${\chi}(G)=4$ with 100% probability, when applied to two actual map and two planar graphs. The proposed "four color algorithm", therefore, could be employed as a general algorithm to determine four-color for planar graphs.

References

  1. Wikipedia, "Graph Coloring," http://en.wikipedia.org/wiki/Graph_Coloring, Wikimedia Foundation Inc., 2013.
  2. Wikipedia, "Four Color Theorem," http://en.wikipedia.org/wiki/Four_Color_Theorem, Wikimedia Foundation Inc., 2008.
  3. R. Thomas, "The Four Color Theorem," School of Mathematics, Georgia Institute of Technology, Atlanta, Georgia, http://www.math.gatech.edu/ -thomas/FC/ fourcolor.html, 2007.
  4. M. Moore, "Four Color Theorem," Department of Mathematical Sciences, University of Arkansas, 2006.
  5. I. Cahit, "The Four Color Theorem and Three Proofs," http://www.emu.edu.tr/-cahit/The Four Color Theorem - Three Proofs.html, 2005.
  6. K. Brown, "The Four Color Theorem," http:// www.mathpages.com/home/kmath266/kmath26 6.htm, 2008.
  7. E. W. Weisstein, "The Four-Color Theorem," Wolfram MathWorld, http://mathworld.wolfram.com /Four-ColorTheorem.html, 2013.
  8. K. Appel and W. Haken, "Every Planar Map is Four-Colorable, II: Reducibility," Illinois Journal of Math., Vol. 21, pp. 491-567, 1977.
  9. M. Gardner, "Mathmatical Games: On Tessellatings the Plane with Convex Polygons," Science American, Vol. 232, pp. 112-117, 1975.
  10. S. Wagon, "Mathematica in Action, 2nd Ed.," New York: Springer-Verlag, pp. 535-536, 1999.
  11. S. Wagon, "A Machine Resolution of a Four-Color Hoax," Proceedings of the 14th Canadian Conference on Computational Geometry, pp. 174-185, 2002.
  12. A. B. Kempe, "On the Geographical Problem of the Four Colors," American Journal of Math., Vol. 2, pp. 193-200, 1879. https://doi.org/10.2307/2369235
  13. P. J. Heawood, "On the Four-Color Map Theorem," Quart. Journal Pure Math, Vol. 29, pp. 270-285, 1898.
  14. N. Robertson, D. P. Sanders, P. Seymour, and R. Thomas, "A New Proof of the Four-Colour Theorem," Electronic Research Announcements of the American Mathematical Society, Vol. 2, No. 1, 1996.
  15. A. Dharwadker, "A New Proof of the Four Colour Theorem," http://www.geocities.com/dharwadker/, 2000.
  16. A. Dharwadker, "The Vertex Coloring Algorithm,"http://www.geocities.com/dharwad ker/vertex_coloring/, 2006.
  17. Wikipedia, "Degree (Graph Theory)," http://en. wikipedia.org/wiki/Degree_(graph-theory), Wikimedia Foundation Inc., 2013.
  18. Wikipedia, "Hadwiger-Nelson Problem," http://en.wikipedia.org/wiki/Hadwiger_Nelson_Problem, Wikimedia Foundation Inc., 2013.