Petra. A survey on known upper bounds for multichromatic number for hexagonal graphs
Petra Šparl
In: SOR '11 proceedings., 28-30 September, Dolenjske Toplice, Slovenia.

## Abstract

\begin{abstract} An optimization problem in the designof cellular networks is to assign sets of frequencies to transmittersto avoid unacceptable interference. Frequency assignment problem can beabstracted as a multicoloring problem on a weighted subgraph of the infinite triangularlattice, called hexagonal graph. In this paper a survey of known upperbounds for multichromatic number $\chi_{m}(G)$ in terms of weighted cliquenumber $\omega_{m}(G)$ for hexagonal graphs and some open problemsare presented. \end{abstract}

EPrint Type: Conference or Workshop Item (Paper) Project Keyword UNSPECIFIED Theory & Algorithms 8686 Igor Pesek 20 February 2012