A Survey on Radio k-Colorings of Graphs
Pratima Panigrahi · 2009
The frequency assignment problem has been started from the discovery that transmitters, received the same or closely related frequencies, had interferences with one another. Nearly three decade back this problem has been modelled as a graph labelling problem. This labelling has several variations depending upon the type of assignment of frequency to transmitters. Here we shall discuss about some of them and give a detail survey on the most recent frequency assignment problem called the radio k-coloring of graphs.