Qu, "Roulette wheel graph colouring
for solving examination timetabling problems," in Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications, vol.
considers the problem to assign colours to the vertices of a given graph in such a way that adjacent vertices receive distinct colours.
We apply these ideas to three problems: maximum matching, graph colouring
and Kolmogorov complexity.
Keywords: Graph theory graph colouring
graph minors Hadwiger's conjecture.
A number of commonly used strategies have been adopted from the graph colouring
Andrea Schaerf and Luca Di Gaspero , reduced the exam timetabling problem into a graph colouring
However, this is just 0 if there exists x [member of] [I.sub.n] such that [f.sub.0](x) = f (x), as might often occur (for example, in graph colouring
, when x is a complete graph).
Enumerating maximal independent sets with applications to graph colouring
. Operations Research Letters, 32:547-556, 2004.
All of the above graph colouring
parameters have natural list generalizations.
Problems, chapter 4.9, pages 86-89.
The subject of topological obstructions to graph colourings
was started when Lovasz determined the chromatic numbers of Kneser graphs in Lovasz (1978).