Informace o publikaci
Steinberg's Conjecture is false
| Autoři | |
|---|---|
| Rok publikování | 2017 |
| Druh | Článek v odborném periodiku |
| Časopis / Zdroj | JOURNAL OF COMBINATORIAL THEORY SERIES B |
| Citace | |
| Doi | http://dx.doi.org/10.1016/j.jctb.2016.07.006 |
| Klíčová slova | Planar graphs; Graph coloring; Steinberg's Conjecture |
| Popis | 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. |