L (h,1)-labeling subclasses of planar graphs

Journal of Parallel and Distributed Computing

Volumn 64, Issue 3, 2004, Pages 414-426

  Calamoneri, Tiziana ^a   Petreschi, Rossella ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

L(h,1) labeling; Outerplanar graphs; Radio networks; Regular tiling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BROADCASTING; CELLULAR NEURAL NETWORKS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBLEM SOLVING; RADIO STATIONS; SIGNAL PROCESSING;

OUTERPLANAR GRAPHS; RADIO NETWORKS; REGULAR TILING;

RADIO COMMUNICATION;

EID: 2942581560     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2003.11.005     Document Type: Article

References (20)

1. Bertossi A.A., Bonuccelli M.A. Code assignment for hidden terminal interference avoidance in multihop packet radio networks. IEEE/ACM Trans. Networking. 3:1995;441-449.
2. A.A. Bertossi, C.M. Pinotti, R.B. Tan, Efficient use of radio spectrum in wireless networks with channel separation between close stations, ACM Workshop DIAL M 2000, Boston, MA, 2000.
3. H.L. Bodlaender, T. Kloks, R.B. Tan, J. van Leeuwen, λ -coloring of graphs, in: Proceedings of STACS 2000, Lectures Notes in Computer Science, Vol. 1770, Springer, New York, 2000, pp. 395-406.
4. Brandstadt A., Le V.B., Spinrad J.P. Graph classes: a survey, SIAM Monographs on Discrete Mathematics and Applications. 1999;SIAM, Philadelphia, PA.
5. R.J. Bruce, M. Hoffmann, L(p,q) -labeling of outerplanar graphs, Technical Report No. 2003/9, Department of Mathematics and Computer Science, University of Leicester, England.
6. T. Calamoneri, R. Petreschi, λ -coloring unigraphs, J. Comput. System Sci. 2001 (submitted.) (A preliminary version has been published in Proceedings Latin American Theoretical Informatics (LATIN '02), Lecture Notes in Computer Science, Vol. 2286, Springer, Berlin, 2002, pp. 236-247).
7. T. Calamoneri, R. Petreschi, λ -coloring unigraphs, J. Comput. System Sci. 2001 (submitted.) (A preliminary version has been published in Proceedings Latin American Theoretical Informatics (LATIN '02), Lecture Notes in Computer Science, Vol. 2286, Springer, Berlin, 2002, pp. 236-247).
8. T. Calamoneri, R. Petreschi, Edge-clique graphs and the l-coloring problem, J. Brazilian Comput. Soc., (2002), accepted for publication (Special Issue in honor of Jayme Szwarcfiter's 60th birthday).
9. Chang G.J., Kuo D. The. L(2,1) -labeling problem on graphs SIAM J. Discrete Math. 9:1996;309-316.
10. Chiba N., Nishizeki T. Planar Graphs: Theory and Algorithms. 1988;North-Holland, Amsterdam.
11. J. Fiala, T. Kloks, J. Kratochvíl, Fixed-parameter complexity of λ -labelings, in: Proceedings of Graph-Theoretic Concepts of Computer Science (WG99), Lectures Notes in Computer Science, Vol. 1665, Springer, New York, 1999, pp. 350-363.
12. D.A. Fotakis, S.E. Nikoletseas, V.G. Papadoulou, P.G. Spirakis, NP-completeness results and efficient approximations for radiocoloring in planar graphs, in: Proceedings of 25th International Symposium on Mathematics Foundations of Computer Science (MFCS 2000), Bratislava, Slovak Rep., 2000.
13. Griggs J.R., Yeh R.K. Labeling graphs with a condition at distance 2. SIAM J. Discrete Math. 5:1992;586-595.
14. van den Heuvel J., Leese R.A., Shepherd M.A. Graph labelling and radio channel assignment. J. Graph Theory. 29:1998;263-283.
15. Ore O. The Four Color Problem. 1967;Academic Press, New York.
16. Sakai D. Labeling chordal graphs. distance two condition SIAM J. Discrete Math. 7:1994;133-140.
17. G. Wegner, Graphs with given diameter and a coloring problem, Technical Report, University of Dortmund, 1977.
18. n and related graphs SIAM J. Discrete Math. 8(4):1995;499-506.
19. R.Y. Yeh, Labeling graphs with a condition at distance two, Ph.D. Thesis, Department of Mathematics, University of South Carolina, Columbia, SC, 1990.
20. Zhou X., Kanari Y., Nishizeki T. Generalized vertex-colorings of partial. k -trees IEICE Trans. Fund. E83-A(4):2000;671-678.