Journal of Combinatorial Theory, Series BVolume 64, Issue 1, May 1995, Pages 101-107Regular Article3-List-Coloring Planar Graphs of Girth 5Author links open overlay panelThomassen C.Show moreShareCitehttps://doi.org/10.1006/jctb.1995.1027Get rights and contentUnder an Elsevier user licenseopen archiveAbstractWe prove that every planar graph of girth at least 5 is 3-choosable. It is even possible to precolor any 5-cycle in the graph. This extension implies Grötzsch′s theorem that every planar graph of girth at least 4 is 3-colorable.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1995 Academic Press. All rights reserved.