Abstract
A new graph colouring related problem called the colour switching problem is introduced. By giving a reduction from the colour switching problem to the weighted matching problem on bipartite graphs, we show that the colour switching problem can be solved in O(
n
built3
2
log
n) time. The colour switching problem has many useful applications in computer science and engineering. We outline an application to the channel allocation problem in mobile cellular radio systems.