Graph algorithm vertex coloring

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...

Full description

Bibliographic Details

Main Authors:	Suyudi, M., Sukono, ., Mustafa, Mamat, Bon, A.T.
Format:	Conference or Workshop Item
Language:	en
Published:	2019
Subjects:	QA Mathematics TA Engineering (General). Civil engineering (General)
Online Access:	http://eprints.unisza.edu.my/1834/1/FH03-FIK-20-38047.pdf http://eprints.unisza.edu.my/1834/
Tags:	Add Tag No Tags, Be the first to tag this record!