On the maximum degree chromatic number of a graph

On the maximum degree chromatic number of a graph

ENGLISH ABSTRACT: Determining the (classical) chromatic number of a graph (i.e. finding the smallest number of colours with which the vertices of a graph may be coloured so that no two adjacent vertices receive the same colour) is a well known combinatorial optimization problem and is widely enco...

Full description

Bibliographic Details
Main Author: Nieuwoudt, Isabelle
Other Authors: Van Vuuren, J. H.
Format: Others
Language:en_ZA
Published: Stellenbosch : Stellenbosch University 2012
Subjects:
Graph coloring
Graphic methods
Graph algorithms
Dissertations > Applied mathematics
Theses > Applied mathematics
Online Access:http://hdl.handle.net/10019.1/46214

Internet

http://hdl.handle.net/10019.1/46214

Similar Items