Labelling graphs with a condition at distance 2
SIAM Journal on Discrete Mathematics
Labeling Chordal Graphs: Distance Two Condition
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
List edge and list total colourings of multigraphs
Journal of Combinatorial Theory Series B
On L(d, 1)-labelings of graphs
Discrete Mathematics
Labeling Products of Complete Graphs with a Condition at Distance Two
SIAM Journal on Discrete Mathematics
A Theorem about the Channel Assignment Problem
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
Total chromatic number of planar graphs with maximum degree ten
Journal of Graph Theory
(2,1)-Total labelling of trees with sparse vertices of maximum degree
Information Processing Letters
(2,1)-Total number of trees with maximum degree three
Information Processing Letters
The (2,1)-total labeling number of outerplanar graphs is at most Δ + 2
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
A tight upper bound on the (2,1)-total labeling number of outerplanar graphs
Journal of Discrete Algorithms
| Hi-index | 0.05 |
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. In this paper we prove that if G is an outerplanar graph with maximum degree @D(G), then @l"2^T(G)==5, or @D(G)=3 and G is 2-connected, or @D(G)=4 and G contains no intersecting triangles.