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. / AFRIKAANSE OPSOMMING: Die bepaling van die (klassieke) chromatiese getal van ’n grafiek (naamlik die kleinste aantal kleure
waarmee die punte van ’n grafiek gekleur kan word sodat geen twee naasliggende punte dieselfde kleur
ontvang nie) is ’n bekende kombinatoriese optimeringsprobleem wat wyd in skeduleringstoepassings
te¨egekom word. Sedert die laat 1960s is die definisie van die chromatiese getal op verskeie maniere
veralgemeen deur die vereiste van onafhanklikheid van die kleurklasse te verslap. / Thesis (DPhil)--Stellenbosch University, 2007.
| Identifer | oai:union.ndltd.org:netd.ac.za/oai:union.ndltd.org:sun/oai:scholar.sun.ac.za:10019.1/46214 |
| Date | 12 1900 |
| Creators | Nieuwoudt, Isabelle |
| Contributors | Van Vuuren, J. H., Grobler, P. J. P., Stellenbosch University. Faculty of Science. Dept. of Mathematical Sciences. |
| Publisher | Stellenbosch : Stellenbosch University |
| Source Sets | South African National ETD Portal |
| Language | en_ZA |
| Detected Language | Unknown |
| Type | Thesis |
| Format | 208 p. : ill. |
| Rights | Stellenbosch University |
Page generated in 0.0022 seconds