Improper Colourings of Unit Disk Graphs

DOI10.1016/j.endm.2005.06.022zbMath1182.05056OpenAlexW1971470119MaRDI QIDQ3439320

Jean-Sébastien Sereni, Ross J. Kang, Frédéric Havet

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.022

zbMATH Keywords

telecommunicationsunit disk graphsimproper colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes ⋮ Improper colouring of (random) unit disk graphs ⋮ Improper coloring of unit disk graphs ⋮ A NEW APPROACH TO THE VERTEX COLORING PROBLEM ⋮ IMPROPER COLORING OF WEIGHTED GRID AND HEXAGONAL GRAPHS

Cites Work

• Unnamed Item
• Unit disk graphs
• A proof of the four color theorem
• On coloring unit disk graphs
• Defective coloring revisited
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• List Improper Colourings of Planar Graphs
• Channel assignment and weighted coloring

This page was built for publication: Improper Colourings of Unit Disk Graphs