Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,General Mathematics,Statistics and Probability
Reference11 articles.
1. M. R. Garey and D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness, San Francisco (1979).
2. R. Battiti, A. A. Bertossi, and M. A. Bonuccelli, “Assigning codes in wireless network:Bounds and scaling properties,” Wireless Networks, 5, No. 3, 195–209 (1999).
3. H. L. Bodlaender, T. Kloks, R. B. Tan, and J. Leeuwen, “Approximation for λ-coloring of graphs,” Lect. Notes Comput. Sci., 1770, 395–409 (2000).
4. G. J. Chang and D. Kuo, “The L(2, 1)-labeling problem on graphs,” SIAM J. Discrete Math., 9, 309–316 (1996).
5. J. Fiala, J. Kratochvil, and A. Proskurowski, “Distance constrained labeling of precoloed trees,” Lect. Notes Comput. Sci., 2202, 285–292 (2001).