T-colorings of graphs: recent results and open problems
Discrete Mathematics - Special issue: advances in graph labelling
Labelling graphs with a condition at distance 2
SIAM Journal on Discrete Mathematics
Labeling Chordal Graphs: Distance Two Condition
SIAM Journal on Discrete Mathematics
Code assignment for hidden terminal interference avoidance in multihop packet radio networks
IEEE/ACM Transactions on Networking (TON)
The $L(2,1)$-Labeling Problem on Graphs
SIAM Journal on Discrete Mathematics
On L(d, 1)-labelings of graphs
Discrete Mathematics
Fixed parameter complexity of λ-labelings
Discrete Applied Mathematics - special issue on the 25th international workshop on graph theoretic concepts in computer science (WG'99)
Frequency Channel Assignment on Planar Networks
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Channel Assignment with Separation for Interference Avoidance in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
A Theorem about the Channel Assignment Problem
SIAM Journal on Discrete Mathematics
On the span in channel assignment problems: bounds, computing and counting
Discrete Mathematics - Special issue: The 18th British combinatorial conference
Labeling trees with a condition at distance two
Discrete Mathematics
Coloring Powers of Chordal Graphs
SIAM Journal on Discrete Mathematics
Real Number Graph Labellings with Distance Conditions
SIAM Journal on Discrete Mathematics
A bound on the chromatic number of the square of a planar graph
Journal of Combinatorial Theory Series B
The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography
The Computer Journal
The Channel Assignment Problem with Variable Weights
SIAM Journal on Discrete Mathematics
Labeling planar graphs with a condition at distance two
European Journal of Combinatorics
Labelings of Graphs with Fixed and Variable Edge-Weights
SIAM Journal on Discrete Mathematics
$L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
SIAM Journal on Discrete Mathematics
New bounds for the L(h, k) number of regular grids
International Journal of Mobile Network Design and Innovation
Graph labeling and radio channel assignment
Journal of Graph Theory
Real Number Channel Assignments for Lattices
SIAM Journal on Discrete Mathematics
Labeling the r-path with a condition at distance two
Discrete Applied Mathematics
Fast exact algorithm for L(2, 1)-labeling of graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Distance three labelings of trees
Discrete Applied Mathematics
Survey: Randomly colouring graphs (a combinatorial view)
Computer Science Review
Griggs and Yeh's Conjecture and $L(p,1)$-labelings
SIAM Journal on Discrete Mathematics
Labeling Planar Graphs without 4,5-Cycles with a Condition on Distance Two
SIAM Journal on Discrete Mathematics
On real number labelings and graph invertibility
Discrete Applied Mathematics
Fast exact algorithm for L(2,1)-labeling of graphs
Theoretical Computer Science
The L(p,q)-labelling of planar graphs without 4-cycles
Discrete Applied Mathematics
| Hi-index | 0.05 |
Graph labellings form an important graph theory model for the channel assignment problem. An optimum labelling usually depends on one or more parameters that ensure minimum separations between frequencies assigned to nearby transmitters. The study of spans and of the structure of optimum labellings as functions of such parameters has attracted substantial attention from researchers, leading to the introduction of real number graph labellings and @l-graphs. We survey recent results obtained in this area.