Upper bounds of entire chromatic number of plane graphs
type: Item
instance of: scholarly article
title: Upper bounds of entire chromatic number of plane graphs
zbMATH Open document ID: 0924.05030
published in: European Journal of Combinatorics
publication date: 1999-09-15T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 1310850
zbMATH Keywords: entire chromatic number
zbMATH Keywords: plane graph
author: Weifan Wang
MaRDI profile type: Publication
full work available at URL: eujc.1998.0258
OpenAlex ID: W42302203
DOI: 10.1006/EUJC.1998.0258
Recommended article: An upper bound of linear chromatic number of planar graphs
Recommended article: Q4995341
Recommended article: Upper bound on the circular chromatic number of the plane
Recommended article: Q3832590
Recommended article: The complete chromatic number of some planar graphs
Recommended article: Q4871176
Recommended article: An upper bound for the total chromatic number
Recommended article: New upper bounds for the chromatic number of a graph
Recommended article: A bound on the chromatic number of an almost planar graph
description: scientific article; zbMATH DE number 1310850