3 ms·Colours Can Compute2 points by ColinWright 6y agoColinWright 6y agoAlthough 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.