Labeling trees with a condition at distance two

Discrete Mathematics

Volumn 306, Issue 14, 2006, Pages 1534-1539

  Calamoneri, Tiziana ^a   Pelc, Andrzej ^b   Petreschi, Rossella ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

Author keywords

L (h, k) labeling; Maximum degree; Tree; Vertex labeling

Indexed keywords

GRAPH THEORY; INTEGER PROGRAMMING; OPTIMAL CONTROL SYSTEMS; PARAMETER ESTIMATION;

L (H, K)-LABELING; MAXIMUM DEGREE; OPTIMAL SPAN; VERTEX LABELING;

TREES (MATHEMATICS);

EID: 33745676997     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2005.04.024     Document Type: Article

References (23)

1. K.I. Aardal, S.P.M. van Hoesel, A.M.C.A. Koster, C. Mannino and A. Sassano, Models and Solution Techniques for Frequency Assignment Problems. ZIB-Report 01-40, Konrad-Zuse-Zentrum fur Informationstechnik Berlin, 2001.
2. A.A. Bertossi, C.Pinotti, R.B.Tan, L (2, 1)- and L (2, 1, 1)-labeling of graphs with applications to channel assignment in wireless networks, Proc. Fourth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2000).
3. H.L. Bodlaender, T.Kloks, R.B.Tan, J.Van Leeuwen, Lambda coloring of Graphs, Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2000), Lecture Notes in Computer Science, vol. 1770, 2000, pp. 395-406.
4. T. Calamoneri, Exact solution of a class of frequency assignment problems in cellular networks (Extended Abstract), Eighth Italian Conference on Theoretical Computer Science (ICTCS'03), Lecture Notes in Computer Science, vol. 2841, 2003, pp. 163-173.
5. T. Calamoneri, R. Petreschi, L (h, 1)-Labelling subclasses of Planar Graphs, J. Parallel Distr. Com. 64 (2004) 414-426.
6. T. Calamoneri, R. Petreschi, Edge-clique graphs and the lambda-coloring problem, J. Brazilian Comput. Soc., (Special Issue in honor of Jaime Szwarcfiter's 60th birthday), 2002.
7. T. Calamoneri, R. Petreschi, L (2, 1)-coloring matrogenic graphs (Extended Abstract), Latin American Theoretical Informatics (LATIN '02), Lecture Notes in Computer Science, vol. 2286, 2002, pp. 236-247; Discrete Appl. Math., to appear.
8. T. Calamoneri, R. Petreschi, On the Radiocoloring Problem, Proceedings of Fourth International Workshop on Distributed Computing, Mobile and Wireless Computing (IWDC'02), Lecture Notes in Computer Science, vol. 2571, 2002, 118-127.
9. Chang G.J., and Kuo D. The L (2, 1)-labeling problem on graphs. SIAM J. Discrete Math. 9 (1996) 309-316
10. Georges J.P., and Mauro D.W. Generalized vertex labelings with a condition at distance two. Congr. Numer. 109 (1995) 141-159
11. Georges J.P., and Mauro D.W. On the size of graphs labeled with a condition at distance two. J. Graph Theory 22 (1996) 47-57
12. j-numbers of the products of complete graphs. Congr. Numer. 140 (1999) 141-160
13. Georges J.P., and Mauro D.W. Labeling trees with a condition at distance two. Discrete Mat. 269 (2003) 127-148
14. Georges J.P., Mauro D.W., and Stein M.I. Labeling products of complete graphs with a condition at distance two. SIAM J. Discrete Math. 14 (2000) 28-35
15. Griggs J.R., and Yeh R.K. Labeling graphs with a condition at distance 2. SIAM J. Discrete Math. 5 (1992) 586-595
16. Hale W.K. Frequency assignment: theory and application. Proc. IEEE 68 (1980) 1497-1514
17. van den Heuvel J., Leese R.A., and Shepherd M.A. Graph labelling and radio channel assignment. J. Graph Theory 29 (1998) 263-283
18. Jensen T.R., and Toft B. Graph Coloring Problems (1995), Wiley, New York
19. Liu D., and Yeh R.K. On distance two labelings of graphs. Ars Combinatoria 47 (1997) 13-22
20. Murphey R.A., Pardalos P.M., and Resende M.G.C. Frequency assignment problems. In: Du D.-Z., and Pardalos P.M. (Eds). Handbook of Combinatorial Optimization (1999), Kluwer Academic Publishers, Dordrecht 295-377
21. Sakai D. Labeling chordal graphs: distance 2 condition. SIAM J. Discrete Math. 7 (1994) 133-140
22. M. Shepherd, Radio channel assignment, Ph.D. thesis, Merton College, Oxford, 1998.
23. n and related graphs. SIAM J. Discrete Math. 8 (1995) 499-506