λ-coloring of graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1770, Issue , 2000, Pages 395-406

  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 Sciences and Arts of Oklahoma   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COLOR; COLORING; GRAPHIC METHODS;

ADJACENT VERTICES; BIPARTITE GRAPHS; CHORDAL GRAPHS; COLORING PROBLEMS; MAXIMUM DEGREE; OUTERPLANAR GRAPH; RADIO FREQUENCIES; SPLIT GRAPHS;

GRAPH THEORY;

EID: 34247128977     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46541-3_33     Document Type: Conference Paper

References (26)

1. B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, J. ACM 41 (1994) pp. 153-180.
2. Battiti, R., A.A. Bertossi and M.A. Bonuccelli, Assigning codes in wireless networks: Bounds and scaling properties, Wireless Networks 5 (1999) pp. 195-209.
3. Bertossi A.A. and M.A. Bonuccelli, Code assignment for hidden terminal interference avoidance in multihop packet radio networks, IEEE/ACM Trans. on Net- working 3 (1995) pp. 441-449.
4. Bertossi A.A., C. Pinotti and R.B. Tan, L(2; 1; 1)-Labeling problem on graphs, In preparation (1999).
5. Bodlaender, H., A linear time algorithm for finding tree-decompositions of small treewidth, SIAM Journal on Computing 25 (1996) pp. 1305-1317.
6. Bodlaender, H., T. Kloks, R.B. Tan and J. van Leeuwen, λ-coloring of graphs, Tech. Report, Dept. of Computer Science, Utrecht University (1999), in preparation.
7. Brandstädt, A., V.B. Le and J.P. Spinrad, Graph Classes: a Survey, SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia (1999).
8. Chang, G. J. and D. Kuo, The L(2; 1)-labeling problem on graphs, SIAM J. Disc. Math. 9 (1996) pp. 309-316.
9. Chlamtac, I. and S. Kutten, On broadcasting in radio networks - problem analysis and protocol design, IEEE Trans. on Comm. 33 No. 12 (1985) pp. 1240-1246.
10. Chlamtac, I. and S. Pinter, Distributed nodes organization algorithm for channel access in a multihop dynamic radio network, IEEE Trans. on Computers 36 No. 6 (1987) pp. 728-737.
11. Dirac, G.A., On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg 25 (1961) pp. 71-76.
12. Fiala J., T. Kloks and J. Kratochvíl, Fixed-parameter complexity of λ-labelings, In: Graph-Theoretic Concept of Computer Science, Proceedings 25th WG '99, Lecture Notes in Computer Science vol. 1665, Springer Verlag (1999), pp. 350-363.
13. Georges, J. P. and D. W. Mauro, On the size of graphs labeled with a condition at distance two, Journal of Graph Theory 22 (1996) pp. 47-57.
14. Georges, J. P., D. W. Mauro and M. A. Whittlesey, Relating path coverings to vertex labelings with a condition at distance two, Discrete Mathematics 135 (1994) pp. 103-111.
15. M. C. Golumbic, Algorithmic graph theory and perfect graphs, Academic Press, New York (1980).
16. Griggs, J. R. and R. K. Yeh, Labeling graphs with a condition at distance 2, SIAM J. Disc. Math. 5 (1992) pp. 586-595.
17. Harary, F., Private communication to Paul Spirakis.
18. Jonas, K., Graph colorings analogues with a condition at distance two: L(2; 1)- labelings and list λ-labelings, Ph.D. thesis, University of South Carolina (1993).
19. Kant, G., Augmenting Outerplanar Graphs, J. Algorithms 21 (1996) pp. 1-25.
20. Kloks, T., Treewidth-computations and approximations, Springer-Verlag, LNCS 842 (1994).
21. Liu, D. D.-F. and R. K. Yeh, On distance two labelings of graphs, ARS Combinatorica 47 (1997) pp. 13-22.
22. Makansi, T., Transmitter-oriented code assignment for multihop packet radio, IEEE Trans. on Comm. 35 No. 12 (1987) pp. 1379-1382.
23. Sakai, D., Labeling chordal graphs: distance two condition, SIAM J. Disc. Math. 7 (1994) pp. 133-140.
24. Whittlesey, M. A., J. P. Georgess and D. W. Mauro, On the lambda-coloring of Qn and related graphs, SIAM J. Disc. Math. 8 (1995) pp. 499-506.
25. Yeh, R.K., Labeling graphs with a condition at distance two, Ph.D. Thesis, University of South Carolina (1990).
26. Zhou, X., Y. Kanari and T. Nishizeki, Generalized Vertex-Colorings of Partial k-Trees, IEICE Trans. Fundamentals (2000), to appear.