The proof of Steinberg's three coloring conjecture

I. Cahit

The well-known Steinberg's conjecture asserts that any planar graph without 4- and 5-cycles is 3 colorable. In this note we have given a short algorithmic proof of this conjecture…