Carleton University
Technical Report TR-60
August 1984
Uniquely Colourable m-Dichromatic Oriented Graphs
V. Neumann-Lara, N. Santoro, J. Urrutia
Abstract
The dichromatic number dk (D) of a digraph D is the minimum number of colours needed to colour VD in such a way that no monochromatic directed cycle is obtained. A digraph D is called uniquely colourable if any acyclic dk (D)-colouring of V(D) induces the same partition of VD). In this paper we construct an infinite family of uniquely colourable m-dichromatic oriented graphs for all m2.