Linear choosability of graphs
type: Item
instance of: scholarly article
title: Linear choosability of graphs
zbMATH Open document ID: 1203.05054
author: L. Esperet
author: Mickaël Montassier
author: André Raspaud
published in: Discrete Mathematics
publication date: 2008-07-11T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5300650
zbMATH Keywords: graph coloring
zbMATH Keywords: choosability under constraints
MaRDI profile type: Publication
full work available at URL: j.disc.2007.07.112
OpenAlex ID: W2005086949
cites work: Acyclic coloring of graphs
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Acyclic list 7‐coloring of planar graphs
cites work: Minimum partition of a matroid into independent subsets
cites work: Q3922703
cites work: Some simplified NP-complete graph problems
cites work: Acyclic colorings of planar graphs
cites work: Colouring a graph frugally
cites work: A bound on the chromatic number of the square of a planar graph
cites work: Q4382863
cites work: List Improper Colourings of Planar Graphs
cites work: Graph colorings with local constraints -- a survey
cites work: Coloring the square of a planar graph
cites work: Q3115277
cites work: Linear coloring of graphs
DOI: 10.1016/J.DISC.2007.07.112
description: scientific article; zbMATH DE number 5300650