Wolfram Library Archive

Courseware Demos MathSource Technical Notes
All Collections Articles Books Conference Proceedings

Applications of Graph Coloring

Ünal Ufuktepe
Organization: Izmir Institute of Technology
Department: Department of Mathematics
G. Bacak
Journal / Anthology

Computational Science and Its Applications – ICCSA 2005
Year: 2005
Page range: 522-528

A graph G is a mathematical structure consisting of two sets V(G) (vertices of G) and E(G) (edges of G). Proper coloring of a graph is an assignment of colors either to the vertices of the graphs, or to the edges, in such a way that adjacent vertices / edges are colored differently. This paper discusses coloring and operations on graphs with Mathematica and webMathematica. We consider many classes of graphs to color with applications. We draw any graph and also try to show whether it has an Eulerian and Hamiltonian cycles by using our package ColorG.

*Mathematics > Discrete Mathematics > Graph Theory