T-colorings of graphs: recent results and open problems
Discrete Mathematics - Special issue: advances in graph labelling
Labeling Chordal Graphs: Distance Two Condition
SIAM Journal on Discrete Mathematics
Relating path coverings to vertex labellings with a condition at distance two
Discrete Mathematics
On the $\lambda$-Number of $Q_n$ and Related Graphs
SIAM Journal on Discrete Mathematics
The $L(2,1)$-Labeling Problem on Graphs
SIAM Journal on Discrete Mathematics
Graph classes: a survey
Efficient use of radio spectrum in wireless networks with channel separation between close stations
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
L(2,1)-labeling of planar graphs
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Labeling Products of Complete Graphs with a Condition at Distance Two
SIAM Journal on Discrete Mathematics
NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Fixed-Parameter Complexity of lambda-Labelings
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Frequency Channel Assignment on Planar Networks
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Full Color Theorems for L(2,1)-Colorings
Full Color Theorems for L(2,1)-Colorings
Graph labeling and radio channel assignment
Journal of Graph Theory
Conflict-free star-access in parallel memory systems
Journal of Parallel and Distributed Computing
Generalized powers of graphs and their algorithmic use
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
| Hi-index | 0.00 |
In this paper a survey on the Radiocoloring Problem is presented. The Radiocoloring Problem (RCP) consists of an assignment of colors from the integer set (0..驴) to the vertices of a graph, such that vertices at a distance of at most two get different colors and adjacent vertices get colors which are at least two apart. The aim is to minimize 驴. The RCP arose in the field of wireless radio networks, and it concerns the problem of frequency assignment. Since its formal definition, the RCP has been widely studied due both to its intrinsic theoretical interest and to the growth of wireless networks.