Conflict-free coloring of unit disks
type: Item
instance of: scholarly article
title: Conflict-free coloring of unit disks
zbMATH Open document ID: 1186.68338
author: Nissan Lev-Tov
author: David Peleg
published in: Discrete Applied Mathematics
publication date: 2009-06-30T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 5571995
zbMATH Keywords: unit disk graphs
zbMATH Keywords: conflict-free coloring
zbMATH Keywords: wireless networks
MaRDI profile type: Publication
full work available at URL: j.dam.2008.09.005
OpenAlex ID: W2041216232
cites work: Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
cites work: Q5692720
cites work: On conflict-free coloring of points and simple regions in the plane
cites work: Unit disk graphs
cites work: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
cites work: Q4325546
DOI: 10.1016/J.DAM.2008.09.005
Recommended article: CONFLICT-FREE COLORINGS OF SHALLOW DISCS
Recommended article: Conflict-Free Coloring and its Applications
Recommended article: Dynamic Offline Conflict-Free Coloring for Unit Disks
Recommended article: Conflict-Free Coloring of Graphs
Recommended article: Conflict-Free Colouring of Graphs
Recommended article: Q5692720
Recommended article: On Conflict-Free Multi-coloring
Recommended article: On coloring unit disk graphs
Recommended article: Q5136250
Recommended article: Conflict-Free Coloring of Intersection Graphs
description: scientific article; zbMATH DE number 5571995