2-list-coloring planar graphs without monochromatic triangles
type: Item
instance of: scholarly article
title: 2-list-coloring planar graphs without monochromatic triangles
zbMATH Open document ID: 1167.05029
author: Carsten Thomassen
published in: Journal of Combinatorial Theory. Series B
publication date: 2008-12-08T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 5379221
zbMATH Keywords: list colorings
Wikidata QID: Q56926617
MaRDI profile type: Publication
full work available at URL: j.jctb.2008.02.006
OpenAlex ID: W2082317855
cites work: Coloring face-hypergraphs of graphs on surfaces
cites work: The Grötzsch theorem for the hypergraph of maximal cliques
cites work: Graphs on surfaces
cites work: Every planar graph is 5-choosable
cites work: A short list color proof of Grötzsch's theorem
cites work: List colourings of planar graphs
DOI: 10.1016/J.JCTB.2008.02.006
description: scientific article; zbMATH DE number 5379221