Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
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...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | en_ZA |
| Published: |
Stellenbosch : Stellenbosch University
2012
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| Summary: | 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 encountered in scheduling problems.
Since the late 1960s the notion of the chromatic number has been generalized in several ways by relaxing
the restriction of independence of the colour classes. |
|---|