The proof of Steinberg's three coloring conjecture

Simple item page
dc.creatorCahit, I.
dc.date2006-07-20
dc.date.accessioned2026-07-07T07:20:44Z
dc.date.available2026-07-07T07:20:44Z
dc.descriptionThe 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.
dc.description6 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/math/0607497
dc.identifierhttp://arxiv.org/abs/math/0607497
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/115051
dc.subjectCombinatorics
dc.subject05C
dc.titleThe proof of Steinberg's three coloring conjecture
dc.typetext

Files

Collections

arXiv