| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777664 | Journal of Combinatorial Theory, Series B | 2017 | 5 Pages |
Abstract
Steinberg conjectured in 1976 that every planar graph with no cycles of length four or five is 3-colorable. We disprove this conjecture.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Vincent Cohen-Addad, Michael Hebdige, Daniel Král', Zhentao Li, Esteban Salgado,