Reginald - Document - PDFSEARCH.IO - Document Search Engine

First Page	Meta Content
	Steinberg’s Conjecture Florian Hermanns September 5, 2013 Abstract Every planar graph without 4-cycles and 5-cycles is 3-colorable. This is Steinberg’s conjecture, proposed in 1976 by Richard Steinberg. It is listed Add to Reading List Document Date: 2016-04-12 05:51:08 Open Document File Size: 379,88 KB Share Result on Facebook

UPDATE

Steinberg’s Conjecture Florian Hermanns September 5, 2013 Abstract Every planar graph without 4-cycles and 5-cycles is 3-colorable. This is Steinberg’s conjecture, proposed in 1976 by Richard Steinberg. It is listed Add to Reading List