On the complexity of core, kernel, and bargaining set
Artificial Intelligence
L(2,1) -labelling of generalized prisms
Discrete Applied Mathematics
Griggs and Yeh's Conjecture and $L(p,1)$-labelings
SIAM Journal on Discrete Mathematics
On n-fold L(j,k)-and circular L(j,k)-labelings of graphs
Discrete Applied Mathematics
Labeling outerplanar graphs with maximum degree three
Discrete Applied Mathematics
Determining the l(2,1)-span in polynomial space
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
L(2,1) -labeling of oriented planar graphs
Discrete Applied Mathematics
Determining the L(2,1)-span in polynomial space
Discrete Applied Mathematics
On (s,t)-relaxed L (2,1)-labelings of the square lattice
Information Processing Letters
Multiple L(j,1)-labeling of the triangular lattice
Journal of Combinatorial Optimization
Hi-index | 0.00 |
Given any fixed non-negative integer values h and k, the L(h, k)-labelling problem consists in an assignment of non-negative integers to the nodes of a graph such that adjacent nodes receive values which differ by at least h, and nodes connected by a 2-length path receive values which differ by at least k. The span of an L(h, k)-labelling is the difference between the largest and the smallest assigned frequency. The goal of the problem is to find out an L(h, k)-labelling with a minimum span. The L(h, k)-labelling problem has intensively been studied following many approaches and restricted to many special cases, concerning both the values of h and k and the considered classes of graphs. This paper reviews the results from previously published literature, looking at the problem with a graph algorithmic approach. It is an update of a previous survey written by the same author.