Discrete Applied Mathematics
Labelling graphs with a condition at distance 2
SIAM Journal on Discrete Mathematics
The $L(2,1)$-Labeling Problem on Graphs
SIAM Journal on Discrete Mathematics
Solving the weighted efficient edge domination problem on bipartite permutation graphs
Discrete Applied Mathematics
On the k-path partition of graphs
Theoretical Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Acyclic domination on bipartite permutation graphs
Information Processing Letters
The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography
The Computer Journal
Discrete Applied Mathematics
Linear structure of bipartite permutation graphs and the longest path problem
Information Processing Letters
Approximate L(δ1,δ2,…,δt)-coloring of trees and interval graphs
Networks - Dedicated to Leonhard Euler (1707–1783)
Backbone colorings for graphs: Tree and path backbones
Journal of Graph Theory
Graph labeling and radio channel assignment
Journal of Graph Theory
Channel assignment for interference avoidance in honeycomb wireless networks
Journal of Parallel and Distributed Computing
On the computational complexity of the L(2,1)-labeling problem for regular graphs
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Distance constrained labelings of graphs of bounded treewidth
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Elegant distance constrained labelings of trees
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
The L(2,1)-labeling of unigraphs
Discrete Applied Mathematics
On L(2,1)-coloring split, chordal bipartite, and weakly chordal graphs
Discrete Applied Mathematics
| Hi-index | 0.04 |
An L(p,q)-labeling of a graph G is an assignment f from vertices of G to the set of non-negative integers {0,1,...,@l} such that |f(u)-f(v)|=p if u and v are adjacent, and |f(u)-f(v)|=q if u and v are at distance 2 apart. The minimum value of @l for which G has L(p,q)-labeling is denoted by @l"p","q(G). The L(p,q)-labeling problem is related to the channel assignment problem for wireless networks. In this paper, we present a polynomial time algorithm for computing L(p,q)-labeling of a bipartite permutation graph G such that the largest label is at most (2p-1)+q(bc(G)-2), where bc(G) is the biclique number of G. Since @l"p","q(G)=p+q(bc(G)-2) for any bipartite graph G, the upper bound is at most p-1 far from optimal.