Improper Colourings of Unit Disk Graphs

DOI10.1016/J.ENDM.2005.06.022MaRDI QIDQ3439320zbMATH OpenOpenAlexFDO

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

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

improper colouringtelecommunicationsunit disk graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites work

• A proof of the four color theorem
• Channel assignment and weighted coloring
• Defective coloring revisited
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• scientific article; zbMATH DE number 1250667 (Why is no real title available?)
• List Improper Colourings of Planar Graphs
• On coloring unit disk graphs
• Unit disk graphs

Cited in

(5)

• Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
• Improper colouring of (random) unit disk graphs
• A new approach to the vertex coloring problem
• Improper coloring of unit disk graphs
• Improper coloring of weighted grid and hexagonal graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439320)