Linear and 2-frugal choosability of graphs of small maximum average degree
type: Item
instance of: scholarly article
title: Linear and 2-frugal choosability of graphs of small maximum average degree
zbMATH Open document ID: 1234.05083
author: Nathann Cohen
author: Frédéric Havet
published in: Graphs and Combinatorics
publication date: 2012-01-24T00:00:00Z
full work available at URL: RR-7213.pdf
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 5999874
zbMATH Keywords: linear colouring
zbMATH Keywords: frugal colouring
zbMATH Keywords: planar graph
zbMATH Keywords: discharging method
MaRDI profile type: Publication
OpenAlex ID: W2015986552
cites work: Linear choosability of sparse graphs
cites work: Linear choosability of graphs
cites work: Acyclic colorings of planar graphs
cites work: Colouring a graph frugally
cites work: Linear coloring of graphs
cites work: Linear coloring of planar graphs with large girth
DOI: 10.1007/S00373-010-1009-7
description: scientific article; zbMATH DE number 5999874