Finding a five bicolouring of a triangle-free subgraph of the triangular lattice

Discrete Mathematics

Volumn 244, Issue 1-3, 2002, Pages 103-108

  Havet, Frédéric ^a   Žerovnik, Janez ^b  

^a INRIA   (France)

^b UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

Distributed algorithm; Hexagonal cells; Radio channel assignment; Triangular lattice; Weighted coloring

Indexed keywords

EID: 31244433298     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(01)00079-6     Document Type: Article

References (6)

1. J. R. Griggs, D. Der-Fen Liu, The channel assignment problem for mutually adjacent sites, J. Combin. Theory Ser. A 68 (1994) 169-183.
2. W. K. Hale, Frequency assignment, Proc. IEEE 68 (1980) 1497-1514.
3. F. Havet, Channel assignment and multicolouring of the induced subgraphs of the triangular lattice, Discrete Math. 233 (2001) 219-231.
4. J. van den Heuvel, R. A. Leese, M. A. Shepherd, Graph Labelling and Radio Channel Assignment, J. Graph Theory 29 (1998) 263-283.
5. C. McDiarmid, B. Reed, Channel assignment and weighted coloring, Networks 36 (2000) 114-117.
6. L. Narayanan, S. M. Sehende, Static frequency assignment in cellular networks, Algorithmica 29 (2001) 396-409.