The proof of Steinberg's three coloring conjecture
Combinatorics
2007-05-23 v1
Abstract
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 based on the spiral chains of planar graphs proposed in the proof of the four color theorem by the author in 2004.
Cite
@article{arxiv.math/0607497,
title = {The proof of Steinberg's three coloring conjecture},
author = {I. Cahit},
journal= {arXiv preprint arXiv:math/0607497},
year = {2007}
}
Comments
6 pages, 2 figures