Planar graphs are 1-relaxed, 4-choosable
type: Item
instance of: scholarly article
title: Planar graphs are 1-relaxed, 4-choosable
zbMATH Open document ID: 1221.05077
author: William Cushing
author: H. A. Kierstead
published in: European Journal of Combinatorics
publication date: 2010-06-17T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5722045
MaRDI profile type: Publication
full work available at URL: j.ejc.2009.11.013
OpenAlex ID: W2093490044
cites work: Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
cites work: Q4230860
cites work: Q3922703
cites work: List Improper Colourings of Planar Graphs
cites work: Every planar graph is 5-choosable
cites work: Q4135588
cites work: List colourings of planar graphs
DOI: 10.1016/J.EJC.2009.11.013
description: scientific article; zbMATH DE number 5722045