Although it doesn't say so explicitly, this covers all the ground necessary to show that Graph Three Colouring is NP-Complete. Happy to fill in the details if

Although it doesn't say so explicitly, this covers all the ground necessary to show that Graph Three Colouring is NP-Complete. Happy to fill in the details if anyone asks.