Linear coloring of planar graphs without 4-cycles
type: Item
instance of: scholarly article
title: Linear coloring of planar graphs without 4-cycles
zbMATH Open document ID: 1268.05087
published in: Graphs and Combinatorics
publication date: 2013-07-19T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6189461
zbMATH Keywords: linear coloring
zbMATH Keywords: planar graph
zbMATH Keywords: cycle
zbMATH Keywords: maximum degree
author: Weifan Wang
author: Yiqiao Wang
MaRDI profile type: Publication
full work available at URL: s00373-012-1149-z
OpenAlex ID: W2068900645
cites work: Linear choosability of graphs
cites work: Colouring a graph frugally
cites work: Upper bounds on the linear chromatic number of a graph
cites work: Linear coloring of planar graphs with large girth
cites work: Linear coloring of graphs embeddable in a surface of nonnegative characteristic
cites work: Linear coloring of graphs
DOI: 10.1007/S00373-012-1149-Z
description: scientific article; zbMATH DE number 6189461