On the Delta(d)–chromatic number of a complete balanced multipartite graph
<p>In this paper we solve (approximately) the problem of finding the minimum number of colours with which the vertices of a complete, balanced, multipartite graph G may be coloured such that the maximum degrees of all colour class induced subgraphs are at most some specified natural number d....
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Operations Research Society of South Africa (ORSSA)
2007-06-01
|
| Series: | ORiON |
| Online Access: | http://orion.journals.ac.za/pub/article/view/45 |