List version of L (d,s)-labelings

Theoretical Computer Science

Volumn 349, Issue 1, 2005, Pages 92-98

  Kohl, Anja ^a   Schreyer, Jens ^b   Tuza, Zsolt ^c,d   Voigt, Margit ^b  

^a TU BERGAKADEMIE FREIBERG   (Germany)

^b ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

^c INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^d UNIVERSITY OF PANNONIA   (Hungary)

Author keywords

Channel assignment problem; L(d,s) labeling; List coloring

Indexed keywords

CHANNEL ASSIGNMENT PROBLEM; L(D,S)-LABELING; LIST COLORING;

COLORING; INTEGER PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

GRAPH THEORY;

EID: 27844593163     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.09.032     Document Type: Conference Paper

References (15)

1. N. Alon, and A. Zaks T-choosability in graphs Discrete Appl. Math. 82 1998 1 13
2. H.L. Bodlaender, T. Kloks, R.B. Tan, and J. van Leeuwen Approximations for λ -coloring of graphs Comput. J. 47 2004 193 204
3. G.J. Chang On L (d, 1 ) -labelings of graphs Discrete Math. 220 2000 57 66
4. G.J. Chang, and D. Kuo The L (2, 1 ) -labeling problem on graphs SIAM J. Discrete Math. 9 1996 309 316
5. J. Fiala, J. Kratochvíl, A. Proskurowski, Distance constrained labeling of precolored trees, Lecture Notes in Computer Science, Vol. 2202, Springer, Berlin, 2001, Theoret. Comput. Sci. (2001), 285-292.
6. J.P. Georges, and D.W. Mauro Generalized vertex labelings with a condition at distance two Congr. Numer. 109 1995 141 159
7. J.R. Griggs, and R.K. Yeh Labelling graphs with a condition at distance 2 SIAM J. Discrete Math. 5 1992 586 595
8. W.K. Hale Frequency assignment: theory and applications Proc. IEEE 68 1980 1497 1514
9. D. Král, Coloring powers of chordal graphs, manuscript, SIAM J. Discrete Math., 2003, to appear.
10. D. Král, and R. Škrekovski A theorem about the channel assignment problem SIAM J. Discrete Math. 16 2003 426 437
11. M. Molloy, M.R. Salavatipour, A bound on the chromatic number of the square of a planar graph, preprint, 2002, submitted for publication.
12. D. Sakai Labeling chordal graphs: distance two condition SIAM J. Discrete Math. 7 1994 133 140
13. R.A. Sitters A short proof of a conjecture on the T r -choice number of even cycles Discrete Appl. Math. 92 1999 243 246
14. B.A. Tesman, T-colorings, list T-colorings, and set T-colorings of graphs, Ph.D. Thesis, Department of Mathematics, Rutgers University, New Brunswick, NJ, October 1989.
15. B.A. Tesman List T -colorings of graphs Discrete Appl. Math. 45 1993 277 289