Please use this identifier to cite or link to this item:
Title: Vertex coloring of a graph
Authors: Ufuktepe, Ünal
Bacak, Gökşen
Issue Date: 2004
Publisher: Izmir Institute of Technology
Abstract: 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.
Description: Thesis (Master)--Izmir Institute of Technology, Mathematics, Izmir, 2004
Includes bibliographical references (leaves: 38-39)
Text in English; Abstract: Turkish and English
vii, 39 leaves
Appears in Collections:Master Degree / Yüksek Lisans Tezleri

Files in This Item:
File Description SizeFormat 
T000416.pdfMasterThesis404.41 kBAdobe PDFThumbnail
Show full item record

CORE Recommender

Page view(s)

checked on May 22, 2023


checked on May 22, 2023

Google ScholarTM


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.