Approximations for λ-Colorings of Graphs

Computer Journal

Volumn 47, Issue 2, 2004, Pages 193-204

  Bodlaender, Hans L ^a   Kloks, Ton ^b   Tan, Richard B ^a,c   Van Leeuwen, Jan ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

^c University of Science and Arts of Oklahoma   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; BANDWIDTH; COLOR; FREQUENCIES; PROBLEM SOLVING; TRANSMITTERS; TREES (MATHEMATICS);

COLOR GRAPHS; PLANAR GRAPHS;

GRAPH THEORY;

EID: 1542303740     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/47.2.193     Document Type: Article

References (36)

1. Griggs, J. R. and Yeh, R. K. (1992) Labeling graphs with a condition at distance 2. SIAM J. Disc. Math., 5, 586-595.
2. Chang, G. J. and Kuo, D. (1996) The L (2, 1)-labeling problem on graphs. SIAM J. Disc. Math., 9, 309-316.
3. Fiala, J., Kloks, T. and Kratochvíl, J. (1999) Fixed-parameter complexity of λ-labelings. Graph-Theoretic Concept of Computer Sciencei, Proc. 25th WC'99, Lecture Notes in Computer Science, Vol. 1665, pp. 350-363. Springer-Verlag, Berlin.
4. Jonas, K. (1993) Graph Colorings Analogues with a Condition at Distance Two: L(2, 1)-labelings and list λ-labelings. Ph.D. thesis, University of South Carolina, Columbia, South Carolina.
5. Bertossi, A. A., Pinotti, C. and Tan, R. B. (2000) Efficient use of radio spectrum in wireless networks with channel separation between close stations. DIAL M 2000, 4th Int. Workshop. ACM Press.
6. Sakai, D. (1994) Labeling chordal graphs: distance two condition. SIAM J. Disc. Math., 7, 133-140.
7. Georges, J. P. and Mauro, D. W. (1996) On the size of graphs labeled with a condition at distance two. J. Graph Theory, 22, 47-57.
8. Georges, J. P., Mauro, D. W. and Whittlesey, M. A. (1994) Relating path coverings to vertex labelings with a condition at distance two. Discrete Mathematics, 135, 103-111.
9. Yeh, R. K. (1990) Labeling Graphs with a Condition at Distance Two. Ph.D. Thesis, University of South Carolina, Columbia, South Carolina.
10. Bertossi, A. A. and Bonuccelli, M. A. (1995) Code assignment for hidden terminal interference avoidance in multihop packet radio networks. IEEE/ACM Trans. on Networking, 3, 441-449.
11. Makansi, T. (1987) Transmitter-oriented code assignment for multihop packet radio. IEEE Trans. on Comm., 35(12), 1379-1382.
12. Battiti, R., Bertossi, A. A. and Bonuccelli, M. A. (1999) Assigning codes in wireless networks: Bounds and scaling properties. Wireless Networks, 5, 195-209.
13. Chlamtac, I. and Kutten, S. (1985) On broadcasting in radio networks - problem analysis and protocol design. IEEE Trans. Comm., 33 (12), 1240-1246.
14. Chlamtac, I. and Pinter, S. (1987) Distributed nodes organization algorithm for channel access in a multihop dynamic radio network. IEEE Trans. Comput., 36(6), 728-737.
15. Harary, F., Private communication to Paul Spirakis.
16. Kuo, D. (1995) Graph Labeling Problems. Ph.D. thesis, Dept. of Applied Math., National Chiao Tung Universtiy, Hsinchu, Taiwan.
17. Wu, K.-F. and Yeh, R. K. (2000) Labeling with the circular difference. Taiwanses J. Math., 4, 397-405.
18. Yeh, R. K. (2000) The edge span of distance two labelings of graphs. Taiwanses J. Math., 4, 675-683.
19. Calamoneri, T. and Petreschi, R. (2001) L(2, 1)-Labeling of planar graphs. DIAL M 2001, Proc. 5th Int. Workshop, pp. 28-33. ACM Press.
20. n and related graphs. SIAM J. Disc. Math., 8, 499-506.
21. van den Heuvel, J. and McGuinness, S. (1999) Colouring the Square of a Planar Graph. Report LSE-CDAM-99-06, Centre for Discrete and Applicable Mathematics, London School of Economics, London, U.K.
22. Fotakis, D. A., Nikoletseas, S. E., Papadopoulou, V. G. and Spirakis, P. G. (2000) NP-completeness results and efficient approximations for radiocoloring in planar graphs. 25th International Symposium on the Mathematical Foundations of Computer Science, Proc. MFCS'2000, Lecture Notes in Computer Science, Vol. 1893, pp. 363-372. Springer-Verlag, Berlin.
23. Molloy, M. and Salavatipour, M. R. (2002) Frequency channel assignment on planar networks. In R. Möhring, Raman, R. (eds), Algorithms - ESA 2002, Procs. 10th Ann. European Symposium, Lecture Notes in Computer Science, Vol. 2461, pp. 736-747. Springer-Verlag, Berlin.
24. Calamoneri, T. and Petreschi, R. (2002) L(2, 1)-Coloring matrogenic graphs. LATIN 2002: Theoretical Informatics, Proc. 5th Latin American Symposium, Lecture Notes in Computer Science, Vol. 2286, pp. 236-247. Springer-Verlag, Berlin.
25. Brandstädt, A., Le, V. B. and Spinrad, J. P. (1999) Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia.
26. Golumbic, M. C. (1980) Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York.
27. Bodlaender, H. L. (1996) A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25, 1305-1317.
28. Bodlaender, H.L. (1998) A partial k-arboretum of graphs with bounded treewidth. Theoret. Computer Sci., 209(1-2), 1-45.
29. Zhou, X., Kanari, Y. and Nishizeki, T. (2000) Generalized vertex-colorings of partial k-trees. IEICE Trans. Fundamentals, E83-A(4), 671-678.
30. Harary, F. (1969) Graph Theory. Addison-Wesley, Reading, MA.
31. Kant, G. (1996) Augmenting outerplanar graphs. J. Algorithms, 21, 1-25.
32. Garey, M. R., Johnson, D. S. and Stockmeyer, L. (1976) Some simplified NP-complete graph problems. Theor. Comp. Sc., 1, 237-267.
33. Bodlaender, H. L., Tan, R. B. and van Leeuwen, J. (2000) Finding a Δ-regular supergraph of minimum order. Tech. Report UU-CS-2000-29, Dept. of Computer Science, Utrecht University, Utrecht.
34. Bodlaender, H. L., Kloks, T., Tan, R. B. and van Leeuwen, J. (2000) Approximations for λ-coloring of graphs. 17th Annual Symp. on Theoretical Aspects of Computer Science, Proc. STAGS 2000, Lecture Notes in Computer Science, Vol. 1770, pp. 395-406. Springer-Verlag, Berlin.
35. Chang, G. J., Ke, W. T., Kuo, D., Liu, D. D. and Yeh, R. K. (2000) On L(d.1)-labelings of Graphs. Discrete Math., 220, 57-66.
36. Liu, D. D.-F. and Yeh, R. K. (1997) On distance two labelings of graphs. Ars Combinatorica, 47, 13-22.