Publication details
Steinberg's Conjecture is false
| Authors | |
|---|---|
| Year of publication | 2017 |
| Type | Article in Periodical |
| Magazine / Source | JOURNAL OF COMBINATORIAL THEORY SERIES B |
| Citation | |
| Doi | http://dx.doi.org/10.1016/j.jctb.2016.07.006 |
| Keywords | Planar graphs; Graph coloring; Steinberg's Conjecture |
| Description | Steinberg conjectured in 1976 that every planar graph with no cycles of length four or five is 3-colorable. We disprove this conjecture. (C) 2016 Elsevier Inc. All rights reserved. |