L(2,1)-labeling of planar graph

Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications

Volumn , Issue , 2001, Pages 28-33

  Calamoneri, Tiziana ^a   Petreschi, Rossella ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

L(2, 1) labeling; Multihop radio networks; Outerplanar graphs; Planar graphs

Indexed keywords

COLOR; GRAPH THEORY; RADIO COMMUNICATION; SIGNAL RECEIVERS; TRANSMITTERS;

RADIO NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 0035790393     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. R. Battiti, A.A. Bertossi and M.A. Bonuccelli. Assigning Codes in Wireless Networks: Bounds and Scaling Properties. Wireless Networks, 5:195-209, 1999.
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. H.L. Bodlaender, T. Kloks, R.B. Tan and J. van Leeuwen. λ-Coloring of Graphs. In Proc. of STAGS 2000, pages 395-406. Lectures Notes in Computer Science 1770, 2000.
4. T. Calamoneri and R. Petreschi. λ-Coloring of Regular Tiling. In Proc. of First Cologne-Twente Workshop (CTW). Electronic Notes in Discrete Mathematics, 8, 2001. http://www.elsevier.nl/locate/endmCTW2001.
5. G. Chartrand, D.P. Geller and S. Hedetniemi. Graphs with Forbidden Subgraphs. J. of Combinatorial Theory, ser. B, 10:12-41, 1971.
6. G.I. Chang and D. Kuo. The L(2, 1)-labeling Problem on Graphs. SIAM J. Disc. Math., 9:309-316, 1996.
7. I. Chlamtac and S. Kutten. On Broadcasting in Radio Networks - Problem Analysis and Protocol Design. IEEE Trans. on Comm., 33(12):1240-1246, 1985.
8. I. Chlamtac and S. Pinter. Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network. IEEE Trans. on Compu., 36(6):728-737, 1987.
9. J. Fiala, T. Kloks and J. Kratochvíl. Fixed-parameter Complexity of λ-Labelings. In Proc. Graph-Theoretic Concepts of Compu. Sci. (WG99), pages 350-363. Lectures Notes in Computer Science 1665, 1999.
10. J.R. Griggs and R.K. Yeh. Labeling graphs with a Condition at Distance 2. SIAM J. Disc. Math, 5:586-595, 1992.
11. T. Makansi. Transmitter-Oriented Code Assigment for Multihop Packet Radio. IEEE Trans. on Comm., 35(12):1379-1382, 1987.
12. D. Sakai. Labeling Chordal Graphs: Distance Two Condition. SIAM J. Disc. Math, 7:133-140, 1994.
13. W.T. Tutte. A Theorem on Planar Graphs. Trans. Amer. Math. Soc., 82:99-116, 1956.