Now showing items 1-4 of 4
Vertex coloring of a graph
(Izmir Institute of Technology, 2004)
Vertex coloring is the following optimization problem; given a graph, how many colors are required to color its vertices in such a way that no two adjacent vertices receive the same color? The required number of colors is ...
Applications of graph coloring
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 ...
Applying Mathematica and webMathematica to graph coloring
This paper analyzes some graph issues by using the symbolic program Mathematica and its version for the Web, webMathematica. In particular, we consider the problem of graph coloring: the assignment of colors to the ...
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 ...