 |
|
|
|
|
 |
|
|
Applications of Graph Coloring
|
|
|
|
|
|
| Organization: | Izmir Institute of Technology |
| Department: | Department of Mathematics |
|
|
|
|
|
|
| Computational Science and Its Applications – ICCSA 2005 |
|
|
|
|
|
|
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.
|
|
|
|
|
|
|
|
For the newest resources, visit Wolfram Repositories and Archives »
