On choosability with separation of planar graphs without adjacent short cycles
type: Item
instance of: scholarly article
title: On choosability with separation of planar graphs without adjacent short cycles
zbMATH Open document ID: 1391.05104
author: Min Chen
author: Ko-Wei Lih
author: Weifan Wang
published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series
publication date: 2018-07-24T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 6909792
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: s40840-016-0409-0
OpenAlex ID: W2510248580
cites work: On choosability with separation of planar graphs with forbidden cycles
cites work: Choosability with Separation of Complete Multipartite Graphs and Hypergraphs
cites work: List colourings of planar graphs
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: A not 3-choosable planar graph without 3-cycles
DOI: 10.1007/S40840-016-0409-0
description: scientific article; zbMATH DE number 6909792