The Library
Steinberg's conjecture is false
Tools
Cohen-Addad, Vincent, Hebdige, Michael, Králʼ, Daniel, Li, Zhentao and Salgado, Esteban (2017) Steinberg's conjecture is false. Journal of Combinatorial Theory, Series B, 122 . pp. 452-456. doi:10.1016/j.jctb.2016.07.006 ISSN 0095-8956.
|
PDF
WRAP_1173667-ma-110716-steinberg.pdf - Accepted Version - Requires a PDF viewer. Available under License Creative Commons Attribution Non-commercial No Derivatives 4.0. Download (412Kb) | Preview |
Official URL: http://dx.doi.org/10.1016/j.jctb.2016.07.006
Abstract
Steinberg conjectured in 1976 that every planar graph with no cycles of length four or five is 3-colorable. We disprove this conjecture.
Item Type: | Journal Article | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics | ||||||||||
Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science Faculty of Science, Engineering and Medicine > Science > Mathematics |
||||||||||
Library of Congress Subject Headings (LCSH): | Graph theory | ||||||||||
Journal or Publication Title: | Journal of Combinatorial Theory, Series B | ||||||||||
Publisher: | Academic Press | ||||||||||
ISSN: | 0095-8956 | ||||||||||
Official Date: | January 2017 | ||||||||||
Dates: |
|
||||||||||
Volume: | 122 | ||||||||||
Page Range: | pp. 452-456 | ||||||||||
DOI: | 10.1016/j.jctb.2016.07.006 | ||||||||||
Status: | Peer Reviewed | ||||||||||
Publication Status: | Published | ||||||||||
Access rights to Published version: | Restricted or Subscription Access | ||||||||||
Date of first compliant deposit: | 13 July 2016 | ||||||||||
Date of first compliant Open Access: | 26 July 2017 | ||||||||||
Funder: | Leverhulme Trust (LT) | ||||||||||
Related URLs: |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |
Downloads
Downloads per month over past year