Distance constrained labeling of precolored trees

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

Volumn 2202, Issue , 2001, Pages 285-292

  Fiala, Jiří ^a,b   Kratochvíl, Jan ^a   Proskurowski, Andrzej ^c  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF KIEL   (Germany)

^c UNIVERSITY OF OREGON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; FORESTRY; FREQUENCY ALLOCATION;

ADJACENT VERTICES; DISTANCE CONSTRAINED LABELING; DISTANCE CONSTRAINTS; FIXED INTEGERS; FREQUENCY ASSIGNMENT PROBLEM; GRAPH COLORINGS; POLYNOMIALLY SOLVABLE; PRECOLORING EXTENSION;

TREES (MATHEMATICS);

EID: 84938059460     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45446-2_18     Document Type: Conference Paper

References (14)

1. Battiti, R., A. A. Bertossi, and M. A. Bonuccelli, Assigning codes in wireless networks: Bounds and scaling properties. Wireless Networks 5, 3, (1999), pp. 195–209.
2. Chang, G. J. and D. Kuo, The L(2, 1)-labeling problem on graphs, SIAM J. Disc. Math. 9, (1996), pp. 309–316.
3. Edmonds, J., Paths, trees and flowers, Can. J. Math. 17, (1965), pp. 449–467.
4. Fiala, J., T. Kloks, and J. Kratochvíl, Fixed-parameter complexity of λ-colorings, In: Graph Theoretic Concepts in Computer Science, WG’99, LNCS 1665, (1999), pp. 350–363.
5. Fotakis, D., G. Pantziou, G. Pentaris, and P. Spirakis, Frequency assignment in mobile and radio networks, In: Networks in distributed computing. DIMACS workshop, Ser. Discrete Math. Theor. Comput. Sci. 45, (1997), pp. 73–90.
6. Garey, M. R. and D. S. Johnson, Computers and Intractability, W. H. Freeman, 1979.
7. Griggs, J. R. and R. K. Yeh, Labelling graphs with a condition at distance 2, SIAM J. Disc. Math. 5, (1992), pp. 586–595.
8. 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.
9. van den Heuvel, J., R. A. Leese, and M. A. Shepherd, Graph labeling and radio channel assignment, Journal of Graph Theory, 29, (1998), pp. 263–283.
10. 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.
11. Hujter, M. and Zs. Tuza, Precoloring extension III. Classes of perfect graphs, Combin. Probab. Comput. 5, (1996), pp. 35–56.
12. Kratochvíl, J. and A. Sebo, Coloring precolored perfect graphs, J. Graph. Th. 25, (1997), pp. 207–215.
13. Liu, D. D.-F. and R. K. Yeh, On distance two labellings of graphs, ARS Combinatorica 47, (1997), pp. 13–22.
14. Yeh, K.-Ch, Labeling graphs with a condition at distance two, Ph.D. Thesis, University of South Carolina, 1990.