On 3-choosability of planar graphs without certain cycles
type: Item
instance of: scholarly article
title: On 3-choosability of planar graphs without certain cycles
zbMATH Open document ID: 1185.05070
author: Haihui Zhang
author: Zhiren Sun
published in: Information Processing Letters
publication date: 2010-04-19T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5694962
zbMATH Keywords: combinatorial problems
zbMATH Keywords: choosability
zbMATH Keywords: planar graph
zbMATH Keywords: cycle
zbMATH Keywords: list assignment
MaRDI profile type: Publication
full work available at URL: j.ipl.2008.01.008
OpenAlex ID: W2092178654
cites work: Colorings and orientations of graphs
cites work: Q3922703
cites work: Planar graphs without cycles of specific lengths
cites work: The complexity of planar graph choosability
cites work: The 4-choosability of plane graphs without 4-cycles
cites work: On structure of some plane graphs with application to choosability
cites work: The 3-choosability of plane graphs of girth 4
cites work: Q4882549
cites work: Bordeaux 3-color conjecture and 3-choosability
cites work: A note on the not 3-choosability of some families of planar graphs
cites work: Every planar graph is 5-choosable
cites work: 3-list-coloring planar graphs of girth 5
cites work: List colourings of planar graphs
cites work: A not 3-choosable planar graph without 3-cycles
cites work: Choosability and edge choosability of planar graphs without five cycles
cites work: Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
cites work: A note on 3-choosability of planar graphs
cites work: \((4m,m)\)-choosability of plane graphs
cites work: Q3428684
DOI: 10.1016/J.IPL.2008.01.008
description: scientific article; zbMATH DE number 5694962