\((k,1)\)-coloring of sparse graphs
type: Item
instance of: scholarly article
title: \((k,1)\)-coloring of sparse graphs
zbMATH Open document ID: 1238.05084
author: Oleg V. Borodin
author: Anna O. Ivanova
author: Mickaël Montassier
author: André Raspaud
published in: Discrete Mathematics
publication date: 2012-04-13T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C42
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 6023647
zbMATH Keywords: improper coloring
zbMATH Keywords: bounded maximum average degree
zbMATH Keywords: discharging procedure with global approach
MaRDI profile type: Publication
full work available at URL: j.disc.2011.11.031
OpenAlex ID: W1800793356
cites work: Every planar map is four colorable. I: Discharging
cites work: Every planar map is four colorable. II: Reducibility
cites work: On the total coloring of planar graphs.
cites work: Circular \((5,2)\)-coloring of sparse graphs
cites work: Q3115724
cites work: Oriented 5-coloring of sparse plane graphs
cites work: Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
cites work: Q3115641
cites work: Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1
cites work: Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
cites work: Q4230860
cites work: Path partitions of planar graphs
cites work: Improper choosability of graphs and maximum average degree
cites work: List Improper Colourings of Planar Graphs
DOI: 10.1016/J.DISC.2011.11.031
description: scientific article; zbMATH DE number 6023647