On the maximum degree chromatic number of a graph
dc.contributor.advisor | Van Vuuren, J. H. | en_ZA |
dc.contributor.advisor | Grobler, P. J. P. | en_ZA |
dc.contributor.author | Nieuwoudt, Isabelle | en_ZA |
dc.contributor.other | Stellenbosch University. Faculty of Science. Dept. of Mathematical Sciences. | en_ZA |
dc.date.accessioned | 2012-08-11T00:27:19Z | |
dc.date.available | 2012-08-11T00:27:19Z | |
dc.date.issued | 2007-12 | |
dc.description.abstract | 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. | en_ZA |
dc.description.abstract | 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. | af_ZA |
dc.description.version | Thesis (DPhil)--Stellenbosch University, 2007. | en_ZA |
dc.format.extent | 208 p. : ill. | |
dc.identifier.uri | http://hdl.handle.net/10019.1/46214 | |
dc.language.iso | en_ZA | |
dc.publisher | Stellenbosch : Stellenbosch University | en_ZA |
dc.rights.holder | Stellenbosch University | en_ZA |
dc.subject | Graph coloring | en_ZA |
dc.subject | Graphic methods | en_ZA |
dc.subject | Graphic methods | en_ZA |
dc.subject | Graph algorithms | en_ZA |
dc.subject | Dissertations -- Applied mathematics | en_ZA |
dc.subject | Theses -- Applied mathematics | en_ZA |
dc.title | On the maximum degree chromatic number of a graph | en_ZA |
dc.type | Thesis | en_ZA |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- nieuwoudt_maximum_2007.pdf
- Size:
- 2.17 MB
- Format:
- Adobe Portable Document Format
- Description: