Distance Constrained Labeling of Precolored Trees

Graph colorings with distance constraints are motivated by the frequency assignment problem. The so called ?(p,q)-labeling problem asks for coloring the vertices of a given graph with integers from the range {0, 1, ..., ?} so that labels of adjacent vertices differ by at least p and labels of vertices at distance 2 differ by at least q, where p, q are fixed integers and integer ? is part of the input. It is known that this problem is NP-complete for general graphs, even when ? is fixed, i.e., not part of the input, but polynomially solvable for trees for (p,q)=(2,1). It was conjectured that the general case is also polynomial for trees. We consider the precoloring extension version of the problem (i.e., when some vertices of the input tree are already precolored) and show that in this setting the cases q=1 and q > 1 behave differently: the problem is polynomial for q=1 and any p, and it is NP-complete for any p > q > 1.

[1]  Jan Kratochvíl,et al.  Coloring precolored perfect graphs , 1997 .

[2]  Jan Kratochvíl,et al.  Fixed-parameter complexity of lambda-labelings , 2001, Discret. Appl. Math..

[3]  Paul G. Spirakis,et al.  Frequency assignment in mobile and radio networks , 1997, Networks in Distributed Computing.

[4]  J. Georges,et al.  On the size of graphs labeled with condition at distance two , 1996 .

[5]  Roberto Battiti,et al.  Assigning codes in wireless networks: bounds and scaling properties , 1999, Wirel. Networks.

[6]  J. V. D. Heuvel,et al.  Graph labeling and radio channel assignment , 1998 .

[7]  Zsolt Tuza,et al.  Precoloring Extension III: Classes of Perfect Graphs , 1996, Combinatorics, Probability and Computing.

[8]  Daphne Der-Fen Liu,et al.  On Distance Two Labellings of Graphs , 1997, Ars Comb..

[9]  Gerard J. Chang,et al.  The L(2, 1)-Labeling Problem on Graphs , 1996, SIAM J. Discret. Math..

[10]  Jerrold R. Griggs,et al.  Labelling Graphs with a Condition at Distance 2 , 1992, SIAM J. Discret. Math..

[11]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.