Improper Colourings of Unit Disk Graphs

Electronic Notes in Discrete Mathematics

Volumn 22, Issue , 2005, Pages 123-128

  Havet, F ^a   Kang, R J ^b   Sereni, J S ^a  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

improper colouring; telecommunications; unit disk graphs

Indexed keywords

EID: 34247134606     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2005.06.022     Document Type: Article

References (9)

1. Appel K., and Haken W. A proof of the four color theorem. Discrete Math. 16 (1976) 179-180
2. Clark B.N., Colbourn C.J., and Johnson D.S. Unit disk graphs. Discrete Math. 86 (1990) 165-177
3. Cowen L., Goddard W., and Jesurum C.E. Defective coloring revisited. J. Graph Theory 24 (1997) 205-219
4. Cowen L.J., Cowen R.H., and Woodall D.R. Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency. J. Graph Theory 10 (1986) 187-195
5. Eaton N., and Hull T. Defective list colorings of planar graphs. Bull. Inst. Combin. Appl. 25 (1999) 79-87
6. Gräf A., Stumpf M., and Weißenfels G. On coloring unit disk graphs. Algorithmica 20 (1998) 277-293
7. Hale W.K. Frequency assignment: Theory and applications. IEEE Proceedings 68 (1980) 1497-1514
8. McDiarmid C., and Reed B. Channel assignment and weighted coloring. Networks 36 (2000) 114-117
9. Škrekovski R. List improper colourings of planar graphs. Combin. Probab. Comput. 8 (1999) 293-299