Is there interest in an informal proof that Graph Vertex 3-Colouring is NPC?

A short time ago, in the discussion about Integer Linear Programming, I made a comment[0] about the relative hardness of Graph Vertex 3-Colouring (G3C), Satisfiability (SAT), and Integer Factoring (FAC). That got a few upvotes, but almost certainly just because it made clear and explicit the connections, and gathered together the ideas scattered through other replies.

But ... would anyone be interested in seeing a relatively complete proof that G3C is NPC?

https://news.ycombinator.com/item?id=44278725