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

A basic problem in the design of mobile telephone networks is to assign sets of radio frequency bands (colours) to transmitters (vertices) to avoid interference. Often the transmitters are laid out like vertices of a triangular lattice in the plane. We investigate the corresponding colouring problem of assigning sets of colours of size Դڵ to each vertex of the triangular lattice so that the sets of colours assigned to adjacent vertices are disjoint. A

• Type: Journal
• Year: 2002
• Where: DM
• Authors: Frédéric Havet, Janez Zerovnik
• Keywords: Colours, DM 2002, Mobile Telephone Networks, Triangular Lattice