Approximating the L(h, k)-labelling problem

Authors:
Magnus M. Halldorsson
Affiliations:
Department of Computer Science, University of Iceland, IS-107 Reykjavik, Iceland
Venue:
International Journal of Mobile Network Design and Innovation
Year:
2006

Citing 5
Cited 1

Labelling graphs with a condition at distance 2

SIAM Journal on Discrete Mathematics
A still better performance guarantee for approximate graph coloring

Information Processing Letters
Zero knowledge and the chromatic number

Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Coloring Powers of Planar Graphs

SIAM Journal on Discrete Mathematics
On the approximability of the L(h, k)-labelling problem on bipartite graphs

SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity

Group path covering and distance two labeling of graphs

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

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.