A note on entire choosability of plane graphs
type: Item
instance of: scholarly article
title: A note on entire choosability of plane graphs
zbMATH Open document ID: 1242.05065
author: Wei Dong
published in: Discrete Applied Mathematics
publication date: 2012-05-30T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6039494
zbMATH Keywords: entire coloring
zbMATH Keywords: plane graph
zbMATH Keywords: list coloring
MaRDI profile type: Publication
full work available at URL: j.dam.2011.12.014
OpenAlex ID: W2030014657
cites work: Q5422499
cites work: The entire chromatic number of a normal graph is at most seven
cites work: A seven-color theorem on the sphere
cites work: On the Entire Coloring Conjecture
cites work: Coupled choosability of plane graphs
cites work: Entire colouring of plane graphs
DOI: 10.1016/J.DAM.2011.12.014
description: scientific article; zbMATH DE number 6039494