Re: New proof of Four Color Theorem



That's not the problem with the "proof". The problem is that the
"proof" asserts that the dual of a cubic graph is cubic, which is
decidedly not the case (consider the regular dodecahedron).

.