A sufficient condition for planar graphs to be (3,1)-choosable
type: Item
instance of: scholarly article
title: A sufficient condition for planar graphs to be (3,1)-choosable
zbMATH Open document ID: 1378.05031
author: Min Chen
author: Yingying Fan
author: Yiqiao Wang
author: Weifan Wang
published in: Journal of Combinatorial Optimization
publication date: 2017-11-09T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6804412
zbMATH Keywords: planar graphs
zbMATH Keywords: choosability with separation
zbMATH Keywords: list coloring
zbMATH Keywords: cycles
MaRDI profile type: Publication
full work available at URL: s10878-017-0124-2
OpenAlex ID: W2597212755
cites work: On choosability with separation of planar graphs with forbidden cycles
cites work: On choosability with separation of planar graphs without adjacent short cycles
cites work: Choosability with Separation of Complete Multipartite Graphs and Hypergraphs
cites work: Brooks-type theorems for choosability with separation
cites work: Q4882549
cites work: A note on choosability with separation for planar graphs.
cites work: Every planar graph is 5-choosable
cites work: List colourings of planar graphs
cites work: A not 3-choosable planar graph without 3-cycles
DOI: 10.1007/S10878-017-0124-2
description: scientific article; zbMATH DE number 6804412