L (p, q) labeling of d-dimensional grids

Discrete Mathematics

Volumn 307, Issue 16, 2007, Pages 2132-2140

  Fertin, Guillaume ^a   Raspaud, André ^b  

^a UNIVERSITÉ DE NANTES   (France)

^b UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Grids; L (p, Q) labeling

Indexed keywords

GRAPH THEORY; MATHEMATICAL MODELS; NUMBER THEORY; NUMERICAL METHODS; OPTIMIZATION; WIRELESS NETWORKS;

DIMENSIONAL HYPERCUBES; GRAPH COLORING PROBLEM;

PROBLEM SOLVING;

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

References (18)

1. A.A Bertossi, C.M. Pinotti, R.B. Tan, Efficient use of radio spectrum in wireless networks with channel separation between close stations, in: Proceedings of the DIAL M for Mobility 2000, Fourth International Workshop on Discrete Algorithms and Methods for Mobile Computing and communications, 2000.
2. Bertossi A.A., Pinotti C.M., and Tan R.B. Channel assignment with separation for special classes of wireless networks: grids and rings. Proceedings of the IPDPS'02, International Parallel and Distributed Processing Symposium (2002), IEEE Computer Society, Silver Spring, MD 28-33
3. H.L. Bodlaender, T. Kloks, R.B. Tan, J. van Leeuwen. λ-coloring of graphs. in: Proceedings of the STACS 2000: 17th Annual Symposium on Theoretical Aspect of Computer Science, Lecture Notes in Computer Science, vol. 1770, Springer, Berlin, 2000, pp. 395-406.
4. T. Calamoneri, R. Petreschi. L (2, 1)-labeling of planar graphs. in: Proceedings of the DIAL M for Mobility 2001, Fifth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, 2001, pp. 28-33.
5. Chang G.J., Ke W.-T., Kuo D., Liu D.D.-F., and Yeh R.K. On L (d, 1)-labelings of graphs. Discrete Math. 220 (2002) 57-66
6. Chang G.J., and Kuo D. The L (2, 1)-labeling on graphs, SIAM. J. Discrete Math. 9 (1996) 309-316
7. A. Dubhashi, M.V.S. Shashanka, A. Pati, S. Ramaprasad, A.M. Shende, Channel assignment for wireless networks modelled as d-dimensional square grids, in: Proceedings of the IWDC'02, International Workshop on Distributed Computing, Lecture Notes in Computer Science, vol. 2571, Springer, Berlin, 2002, pp. 130-141.
8. Fertin G., Godard E., and Raspaud A. Acyclic and k-distance coloring of the grid. Inform. Process. Lett. 87 1 (2003) 51-58
9. Fiala J., Kloks T., and Kratochvil J. Fixed-parameter complexity of λ-labelings. Discrete Appl. Math. 113 (2001) 59-72
10. J. Fiala, J. Kratochvil, A. Proskurowski, Distance constrained labelings of precolored trees, in: Proceedings of the Seventh Italian Conference, ICTCS 2001, Lecture Notes in Computer Science, vol. 2202, Springer, Berlin, 2001, pp. 285-292.
11. Griggs J.R., and Yeh R.K. Labeling graphs with a condition at distance two. SIAM J. Discrete Math. 5 (1992) 586-595
12. Hale W.K. Frequency assignment: theory and applications. Proc. IEEE. 60 (1980) 1497-1514
13. Jha P.K. Optimal L (2, 1)-labeling of cartesian products of cycles with an application to independent domination. IEEE Trans. Circuits Systems I: Fundamental Theory Appl. 47 (2000) 1531-1534
14. Jha P.K., Narayanan A., Sood P., Sundaram K., and Sunder V. On L (2, 1)-labeling of the cartesian product of a cycle and a path. Ars Combin. 55 (2000) 81-89
15. Kral D. Coloring powers of chordal graphs. SIAM J. Discrete Math. 18 3 (2004) 451-461
16. M. Molloy, M.R. Salavatipour, Frequency channel assignment on planar networks, in: Proceedings of the 10th Annual European Symposium (ESA 2002), Rome, Italy, September 2002, Lecture Notes in Computer Science, vol. 2461, Springer, Berlin, 2002, pp. 736-747.
17. Sakai D. Labeling chordal graphs with a condition at distance two. SIAM J. Discrete Math. 7 (1994) 133-140
18. n and related graphs. SIAM J. Discrete Math. 8 (1995) 499-506