The proof of Steinberg's three coloring conjecture

Details The proof of Steinberg's three coloring conjecture The proof of Steinberg's three coloring conjecture

2006-07-20

arxiv.org/abs/math/0607497v1

Mathematics

Combinatorics

6 pages, 2 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The proof of Steinberg's three coloring conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The proof of Steinberg's three coloring conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The proof of Steinberg's three coloring conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-79739