Graph Coloring with webMathematica
Coloring of a graph is an assignment of colors either to the edges of the graph G, or to vertices, or to maps in such a way that adjacent edges/vertices/maps are colored differently. We consider the problem of coloring graphs by using webMathematica which is the new web-based technology. In this paper, we describe some web-based interactive examples on graph coloring with webMathematica.
KeywordsChromatic Number Graph Coloring Edge Coloring Chromatic Index Maximum Vertex Degree
- 1.Appel, K.I., Haken, W., Koch, J.: Every planar map is four colorable I: Discharing. Illinois J. Math. (1977)Google Scholar
- 4.Hutchinson, J.P., Wagon, S.: The four-color theorem. Mathematica in Education and Research 6(1), 42–51 (1997)Google Scholar
- 6.Soaty, T.L., Kainen, P.C.: The four color problem. Dover, New York (1986)Google Scholar
- 8.Wickham, T.: webMathematica A User Guide. Wolfram Reserch, Inc., Champaign (2002)Google Scholar