Entire choosability of near-outerplane graphs
type: Item
instance of: scholarly article
title: Entire choosability of near-outerplane graphs
zbMATH Open document ID: 1198.05053
author: Timothy J. Hetherington
published in: Discrete Mathematics
publication date: 2009-06-19T00:00:00Z
full work available at URL: 200152 6539 Hetherington Preprint.pdf
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C83
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 5566681
zbMATH Keywords: outerplanar graph
zbMATH Keywords: minor-free graph
zbMATH Keywords: series-parallel graph
zbMATH Keywords: entire colouring conjecture
MaRDI profile type: Publication
OpenAlex ID: W2088326412
cites work: Q4846547
cites work: Q3679212
cites work: A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
cites work: Q3922703
cites work: Q2936699
cites work: Q3621528
cites work: Edge and total choosability of near-outerplanar graphs
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: Ein Sechsfarbenproblem auf der Kugel
cites work: On simultaneous edge-face colorings of plane graphs
cites work: On the Entire Coloring Conjecture
cites work: Q3115277
cites work: Simultaneously colouring the edges and faces of plane graphs
cites work: Q4031964
cites work: A short proof of a theorem of dirac's about hadwiger's conjecture
cites work: List colourings of graphs
cites work: The entire coloring of series-parallel graphs
DOI: 10.1016/J.DISC.2008.04.043
description: scientific article; zbMATH DE number 5566681