Computer Sciences

A Short Proof of Groetzsch’s Three Color Theorem

by Ibrahim Cahit

draft only

We have given a short and efficient algorithmic proof of a theorem of Grötzsch that all triangle-free planar graphs... more We have given a short and efficient algorithmic proof of a theorem of Grötzsch that all triangle-free planar graphs are three colorable.