Çalık, Ayberk.
(Thesis (M.S.)-Bogazici University. Institute for Graduate Studies in Science and Engineering, 2013., 2013.)
In the classical graph coloring problem, the vertices of a given graph are colored such that no two adjacent vertices take the same color with the objective of coloring the whole graph with the minimum number of colors. ...