Labelling graphs with a condition at distance 2
SIAM Journal on Discrete Mathematics
Labeling Chordal Graphs: Distance Two Condition
SIAM Journal on Discrete Mathematics
The $L(2,1)$-Labeling Problem on Graphs
SIAM Journal on Discrete Mathematics
The algorithmic use of hypertree structure and maximum neighbourhood orderings
Discrete Applied Mathematics
Strongly orderable graphs: a common generalization of strongly chordal and chordal bipartite graphs
Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
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
Fixed parameter complexity of λ-labelings
Discrete Applied Mathematics - special issue on the 25th international workshop on graph theoretic concepts in computer science (WG'99)
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Algorithms for Maximum Matching and Minimum Fill-in on Chordal Bipartite Graphs
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
A Theorem about the Channel Assignment Problem
SIAM Journal on Discrete Mathematics
The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography
The Computer Journal
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
$L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
SIAM Journal on Discrete Mathematics
On the L(h, k)-labeling of co-comparability graphs
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| Hi-index | 0.89 |
An L(2,1)-labeling of a graph G=(V,E) is a function f:V(G)-{0,1,2,...} such that |f(u)-f(v)|=2 whenever uv@?E(G) and |f(u)-f(v)|=1 whenever u and v are at distance two apart. The span of an L(2,1)-labeling f of G, denoted as SP"2(f,G), is the maximum value of f(x) over all x@?V(G). The L(2,1)-labeling number of a graph G, denoted as @l(G), is the least integer k such that G admits an L(2,1)-labeling of span k. The problem of computing @l(G) of a graph is known to be NP-complete. Griggs and Yeh have conjectured that @l(G)=