3rd European International Conference on Industrial Engineering and Operations Management

Graph Algorithm Vertex Coloring

Mochamad Suyudi, Sukono Sukono, Mustafa Mamat & Abdul Talib Bon
Publisher: IEOM Society International
0 Paper Citations
1 Views
1 Downloads
Track: Decision Sciences
Abstract

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.

Published in: 3rd European International Conference on Industrial Engineering and Operations Management, Pilsen, Czech Republic

Publisher: IEOM Society International
Date of Conference: July 23-26, 2019

ISBN: 978-1-5323-5949-1
ISSN/E-ISSN: 2169-8767