Conflict-free coloring of unit disks

DOI10.1016/j.dam.2008.09.005zbMath1186.68338OpenAlexW2041216232MaRDI QIDQ1028125

Nissan Lev-Tov, David Peleg

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.09.005

zbMATH Keywords

wireless networksconflict-free coloringunit disk graphs

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (9)

Conflict-Free Coloring of Graphs ⋮ Conflict-Free Coloring of Intersection Graphs ⋮ Structural parameterization for minimum conflict-free colouring ⋮ A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs ⋮ Note on coloring of double disk graphs ⋮ Strong conflict-free coloring for intervals ⋮ On variants of conflict-free-coloring for hypergraphs ⋮ Parameterized algorithms for conflict-free colorings of graphs ⋮ Unnamed Item

Cites Work

• Unit disk graphs
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• On conflict-free coloring of points and simple regions in the plane
• Unnamed Item
• Unnamed Item

This page was built for publication: Conflict-free coloring of unit disks