Graph algorithm vertex coloring

Suyudi, M. and Sukono, . and Mustafa, Mamat and Bon, A.T. (2019) Graph algorithm vertex coloring. In: 3rd Eu International Conference on Industrial Engineering and Operations Management,IEOM 2019, 23-26 July 2019, Park Hotel Congress Center PilsenPilsen; Czech Republic.

[img] Text
Restricted to Registered users only

Download (297kB)


Graph coloring problem is to find the minimal number of colors to color vertex of a graph in such a way that every two vertex linked by an edge have different colors. A vertex coloring algorithm has been presented. As a result of applying vertex coloring algorithm no two vertex are to be allocated in same color if they are adjacent in graph. Graph coloring and its generalizations are useful tools in modelling a wide variety of scheduling and assignment problems.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Graph coloring, Vertex coloring
Subjects: Q Science > QA Mathematics
T Technology > TA Engineering (General). Civil engineering (General)
Divisions: Faculty of Informatics & Computing
Depositing User: Muhammad Akmal Azhar
Date Deposited: 23 Nov 2020 06:13
Last Modified: 23 Nov 2020 06:13

Actions (login required)

View Item View Item