An upper bound of linear chromatic number of planar graphs
type: Item
instance of: scholarly article
zbMATH Open document ID: 1265.05258
author: Kan Wang
publication date: 2012-10-05T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6090982
zbMATH Keywords: planar graph
zbMATH Keywords: linear coloring
zbMATH Keywords: linear chromatic number
zbMATH Keywords: maximum degree
zbMATH Keywords: union of vertex-disjoint paths
MaRDI profile type: Publication
Recommended article: Upper bounds on the linear chromatic number of a graph
Recommended article: Q3576679
Recommended article: An upper bound for the chromatic number of line graphs
Recommended article: New upper bounds on linear coloring of planar graphs
Recommended article: Upper bounds of entire chromatic number of plane graphs
Recommended article: A bound on the chromatic number of an almost planar graph
Recommended article: A result on linear coloring of planar graphs
Recommended article: A bound on the chromatic number of the square of a planar graph
Recommended article: Improved bounds on linear coloring of plane graphs
Recommended article: A new upper bound for the chromatic number of a graph
title: An upper bound of linear chromatic number of planar graphs
published in: Journal of Mathematical Study
description: scientific article; zbMATH DE number 6090982