Approximating the L(h, k)-labelling problem
by Magnus M. Halldorsson
International Journal of Mobile Network Design and Innovation (IJMNDI), Vol. 1, No. 2, 2006

Abstract: The (h, k)-colouring problem, better known as the L(h, k)-labelling problem, is that of vertex colouring an undirected graph with non-negative integers so that adjacent vertices receive colours that differ by at least h and vertices of distance-2 receive colours that differ by at least k. We give tight bounds on approximations for this problem on general graphs as well as for bipartite, chordal and split graphs.

Online publication date: Tue, 05-Sep-2006

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mobile Network Design and Innovation (IJMNDI):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com