Channel Assignment and Improper Choosability of Graphs

Abstract. We model a problem proposed by Alcatel, a satellite building company, using improper colourings of graphs. The relation between improper colourings and maximum average degree is underlined, which contributes to generalise and improve previous known results about improper colourings of planar graphs.

• Type: Conference
• Year: 2005
• Where: WG
• Authors: Frédéric Havet, Jean-Sébastien Sereni
• Keywords: Computer Science, Improper Colourings, Maximum Average Degree, Satellite Building Company, WG 2005