Optimal L(h, k)-labeling of regular grids

Discrete Mathematics and Theoretical Computer Science

Volumn 8, Issue 1, 2006, Pages 141-158

  Calamoneri, Tiziana ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Cellular grids; Hexagonal grids; L(h, k) labeling; Squared grids; Triangular grids

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; INTEGER PROGRAMMING; PROBLEM SOLVING;

CELLULAR GRIDS; HEXAGONAL GRIDS; L(H, K)-LABELING; SQUARED GRIDS; TRIANGULAR GRIDS;

OPTIMAL CONTROL SYSTEMS;

EID: 33746066037     PISSN: 13658050     EISSN: 13658050     Source Type: Journal    
DOI: None     Document Type: Article

References (34)

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 and M.A. Bonuccelli. Code Assignment for Hidden Terminal Interference Avoidance in Multihop Packet Radio Networks. IEEE/ACM Trans. on Networking, 3:441-449, 1995.
3. A.A. Bertossi, C.M. Pinotti and R.B. Tan: Channel assignment with separation for interference avoidance in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 14(3): 222-235,2003.
4. Preliminary version in ACM Workshop DIAL M 2000, 2000.
5. H.L. Bodlaender, T. Kloks, R.B. Tan and J. van Leeuwen. λ-Coloring of Graphs. In Proc. of STACS 2000, pages 395-406. Lectures Notes in Computer Science 1770, 2000.
6. T. Calamoneri: the L(h, k)-Labelling Problem: an Annotated Bibliography. Tech. Rep. 04/2004, Dept. of Computer Science, Univ. of Rome "La Sapienza", 2004.
7. T. Calamoneri and R. Petreschi: L(h, 1)-Labeling Subclasses of Planar Graphs. Journal on Parallel and Distributed Computing, 64(3), 2004, pages 414-426.
8. T. Calamoneri and R. Petreschi: L(2, 1)-Coloring Matrogenic Graphs. Accepted for publication on Discrete Applied Mathematics, 2005.
9. Preliminary version in Proceedings of LATIN 2002. Lectures Notes in Computer Science 2286: 236-247, 2002.
10. T. Calamoneri, A. Pelc and R. Petreschi. Labeling trees with a condition at distance two. Accepted for publication on Discrete Mathematics, 2004.
11. Abstract in Proceedings of R.C. Bose Centenary Symp. on Discr. Math. and Applications; electronic notes in discrete mathemathics, 2002, http://www.elsevier.nl/gejng/31/29/24/show/Products/notes/contents.htt
12. T. Calamoneri and R. Petreschi: On the Radio Coloring Problem. In Proceedings of 4th Int.l Workshop on Distributed Computing (IWDC, Lecture Notes in Computer Science 2571, 2002, pages 118-127.
13. G.J. Chang and D. Kuo. The L(2, 1)-labeling Problem on Graphs. SIAM J. Disc. Math., 9:309-316, 1996.
14. J. Fiala, T. Kloks and J. Kratochvíl. Fixed-parameter Complexity of λ-Labelings. Discrete Applied Mathematics 113(1): 59-72, 2001.
15. Preliminary version in Proceedings of Graph-Theoretic Concepts of Compu. Sci. (WG99), pages 350-363. Lectures Notes in Computer Science 1665, 1999.
16. D.A. Fotakis, S.E. Nikoletseas, V.G. Papadoulou and P.G. Spirakis: NP-completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs. In Proceedings of 25th Int.l Symp. on Math. Foundations of Compu. Sci. (MFCS 2000), 2000.
17. J.P. Georges and D.W. Mauro, Generalized Vertex Labelings with a Condition at Distance Two, Congr. Numer. 109 (1995), 141-159.
18. j-numbers of the products of complete graphs, Congr. Numer. 140 (1999), 141-160.
19. J.P. Georges and D.W. Mauro, Labeling trees with a condition at distance two, Discrete Math., 269 (2003), 127-148.
20. J.P. Georges, D.W. Mauro and M.I. Stein, Labeling products of complete graphs with a condition at distance two, SIAM J. Discr. Math. 14 (2000), 28-35.
21. J. R. Griggs and X. T. Jin. Real number graph labellings with distance conditions. SIAM J. Discrete Math, to appear. 2005.
22. J.R. Griggs and R.K. Yeh. Labeling graphs with a Condition at Distance 2. SIAM J. Disc. Math, 5:586-595, 1992.
23. W. K. Hale. Frequency assignment: theory and applications. Proc. IEEE, 68:1497-1514, 1980.
24. J. van den Heuvel, R.A. Leese and M.A. Shepherd: Graph Labelling and Radio Channel Assignment. Journal of Graph Theory 29 (1998): 263-283.
25. A.M.C.A. Koster. Frequency Assignment. Ph.D. thesis, Universiteit Maastricht, 1999.
26. D. Liu and R.K.Yeh, On distance two labelings of graphs, Ars Combinatoria, 47 (1997), 13-22.
27. M.Molloy and M.R. Salavatipour. A Bound on the Chromatic Number of the Square of a Planar Graph. To appear in J. of Combinatorial Theory (Series B).
28. Preliminary version in Proc. 10th Annual European Symposium on Algorithms (ESA'02): 736-747, 2002.
29. R.A. Murphey, P.M. Pardalos and M.G.C. Resende. Frequency Assignment Problems. In Handbook of Combinatorial Optimization, D.-Z. Du and P.M. Pardalos (Eds.): 295-377, 1999. Kluwer Academic Publishers.
30. D. Sakai. Labeling Chordal Graphs: Distance Two Condition. SIAM J. Disc. Math, 7:133-140, 1994.
31. A. Sen, T. Roxborough and S. Medidi: Upper and Lower Bounds of a Class of Channel Assignmet Problems in Cellular Networks. IEEE INFOCOM 1998, 1998.
32. M. Shepherd: Radio Channel Assignment. Ph.D. thesis, Merton College, Oxford, 1998.
33. W.T. Tutte. A Theorem on Planar Graphs. Trans. Amer. Math. Soc., 82:99-116, 1956.
34. n and related graphs, SIAM J. Discr. Math. 8 (1995), 499-506.