Channel assignment and improper choosability of graphs

Authors:
Frédéric Havet;Jean-Sébastien Sereni
Affiliations:
MASCOTTE, I3S-CnRS/InRIA/UnSA, Sophia-Antipolis, France;MASCOTTE, I3S-CnRS/InRIA/UnSA, Sophia-Antipolis, France
Venue:
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Year:
2005

Citing 3
Cited 0

Every planar graph is 5-choosable

Journal of Combinatorial Theory Series B
List improper colorings of planar graphs with prescribed girth

Discrete Mathematics
List Improper Colourings of Planar Graphs

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

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.