I. Cahit. The proof of Steinberg's three coloring conjecture

Natural Sciences / Mathematics / Combinatorics

Submitted on: Jun 18, 2012, 17:28:21

Description: 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.

The Library of Congress (USA) reference page : http://lccn.loc.gov/cn2013300046.

To read the article posted on Intellectual Archive web site please click the link below.


© Shiny World Corp., 2011-2024. All rights reserved. To reach us please send an e-mail to support@IntellectualArchive.com