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!
|
Similar Items: On the maximum degree chromatic number of a graph
- Criticality of the lower domination parameters of graphs
- The crossing number of a graph in the plane
- Higher order domination of graphs
- Kleuring van grafieke met taboesoektogte en die stortvloedalgoritme
- Bounds for Ramsey numbers in multipartite graphs
- The annihilation graphs of commutator posets and lattices