We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Distance three labelings of trees.

Fiala, J. and Golovach, P.A. and Kratochvil, J. and Lidický, B. and Paulusma, Daniel (2012) 'Distance three labelings of trees.', Discrete applied mathematics., 160 (6). pp. 764-779.


An L(2,1,1)-labeling of a graph G assigns nonnegative integers to the vertices of G in such a way that labels of adjacent vertices differ by at least two, while vertices that are at distance at most three are assigned different labels. The maximum label used is called the span of the labeling, and the aim is to minimize this value. We show that the minimum span of an L(2,1,1)-labeling of a tree can be bounded by a lower and an upper bound with difference one. Moreover, we show that deciding whether the minimum span attains the lower bound is an -complete problem. This answers a known open problem, which was recently posed by King, Ras, and Zhou as well. We extend some of our results to general graphs and/or to more general distance constraints on the labeling.

Item Type:Article
Additional Information:Fourth Workshop on Graph Classes, Optimization, and Width Parameters Bergen, Norway, October 2009 — Bergen GROW 09.
Keywords:Distance constrained graph labeling, Linear distance, Circular distance.
Full text:Full text not available from this repository.
Publisher Web site:
Date accepted:No date available
Date deposited:No date available
Date of first online publication:April 2012
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar