Labelling graphs with a condition at distance 2
SIAM Journal on 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
Labeling Planar Graphs with Conditions on Girth and Distance Two
SIAM Journal on Discrete Mathematics
The L(2, 1)-labelling of trees
Discrete Applied Mathematics
A bound on the chromatic number of the square of a planar graph
Journal of Combinatorial Theory Series B
(2,1)-Total labelling of outerplanar graphs
Discrete Applied Mathematics
$L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
SIAM Journal on Discrete Mathematics
(d,1)-total labeling of graphs with a given maximum average degree
Journal of Graph Theory
(2,1)-Total labelling of trees with sparse vertices of maximum degree
Information Processing Letters
| Hi-index | 0.89 |
The (2,1)-total labelling number @l"2^t(G) of a graph G is the width of the smallest range of integers that suffices to label the vertices and the edges of G such that no two adjacent vertices have the same label, no two adjacent edges have the same label and the difference between the labels of a vertex and its incident edges is at least 2. It is known that every tree T with maximum degree @D has @D+1=