Some structural properties of planar graphs and their applications to 3-choosability
type: Item
instance of: scholarly article
title: Some structural properties of planar graphs and their applications to 3-choosability
zbMATH Open document ID: 1233.05164
author: Min Chen
author: Mickaël Montassier
author: André Raspaud
published in: Discrete Mathematics
publication date: 2012-01-11T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5996504
MaRDI profile type: Publication
full work available at URL: j.disc.2011.09.028
OpenAlex ID: W1971430898
cites work: Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
cites work: Planar graphs without cycles of length from 4 to 7 are 3-colorable
cites work: A note on 3-choosability of planar graphs
cites work: Q3922703
cites work: 25 pretty graph colouring problems
cites work: A sufficient condition for a planar graph to be 3-choosable
cites work: Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
cites work: Every planar graph is 5-choosable
cites work: List colourings of planar graphs
cites work: A non-3-choosable planar graph without cycles of length 4 and 5
cites work: Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
cites work: A note on 3-choosability of planar graphs without certain cycles
DOI: 10.1016/J.DISC.2011.09.028
description: scientific article; zbMATH DE number 5996504