Search Results

Now showing 1 - 2 of 2

Edge Coloring of a Graph
(Izmir Institute of Technology, 2004) Beşeri, Tina; Ufuktepe, Ünal
The edge coloring problem is one of the fundamental problem on graphs which often appears in various scheduling problems like the le transfer problem on computer networks. In this thesis, we survey old and new results on the classical edge coloring as well as the generalized edge coloring problems. In addition, we developed some algorithms and modules by using Combinatorica package to color the edges of graphs with webMathematica which is the new web-based technology.
Vertex Coloring of a Graph
(Izmir Institute of Technology, 2004) Bacak, Gökşen; Ufuktepe, Ünal
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 called the chromatic number of G and is denoted by (G). In this thesis, we reviewed the vertex coloring concepts and theorems. The package ColorG which we have improved has many functions for dealing with graph coloring. This package uses a heuristic method due to Brelaz to color the graph so that adjacent vertices have distinct colors.

Master Degree / Yüksek Lisans Tezleri