Note on coloring of double disk graphs
The coloring of disk graphs is motivated by the frequency assignment problem. In 1998, Malesi?ska et al. introduced double disk graphs as their generalization. They showed that the chromatic number of a double disk graph \(G\) is at most \(33\,\omega (G) - 35\), where \(\omega (G)\) denotes the size of a maximum clique in \(G\). Du et al. improved the upper bound to \(31\,\omega (G) - 1\). In this paper we decrease the bound substantially; namely we show that the chromatic number of \(G\) is at most \(15\,\omega (G) - 14\).
double disk graph disk graph frequency assignment problem chromatic number