View of A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles

Return to Article Details A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles Download Download PDF