Distance constrained labelings of trees

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

Volumn 4978 LNCS, Issue , 2008, Pages 125-135

  Fiala, Jiří ^a   Golovach, Petr A ^b   Kratochvíl, Jan ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATION THEORY; FORESTRY; FREQUENCY ALLOCATION; GRAPH ALGORITHMS; POLYNOMIAL APPROXIMATION;

FREQUENCY ASSIGNMENT PROBLEM; GRAPH CLASS; GRAPH MODEL; L(P , Q)-LABELING; LABELINGS; NP COMPLETE; NP-COMPLETENESS; POLYNOMIAL-TIME ALGORITHMS;

TREES (MATHEMATICS);

ALGORITHMS; COMPUTATION; LABELING; PROBLEM SOLVING; TREES;

EID: 70349330654     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79228-4_11     Document Type: Conference Paper

References (23)

1. Calamoneri, T.: The L(h, k)-labeling problem: A survey and annotated bibliography. Computer Journal 49(5), 585-608 (2006)
2. Chang, G.J., Ke, W.-T., Liu, D.D.-F., Yeh, R.K.: On l(d, 1)-labellings of graphs. Discrete Mathematics 3(1), 57-66 (2000)
3. Chang, G.J., Kuo, D.: The L(2, 1)-labeling problem on graphs. SIAM Journal of Discrete Mathematics 9(2), 309-316 (1996)
4. Courcelle, B.: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs. Inf. Comput. 85(1), 12-75 (1990)
5. Fiala, J., Golovach, P.A., Kratochvíl, J.: Distance Constrained Labelings of Graphs of Bounded Treewidth. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 360-372. Springer, Heidelberg (2005)
6. Fiala, J., Kloks, T., Kratochvíl, J.: Fixed-Parameter Complexity of λ-Labelings. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665, Springer, Heidelberg (1999)
7. Fiala, J., Kratochvíl, J.: Complexity of Partial Covers of Graphs. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 537-549. Springer, Heidelberg (2001)
8. Fiala, J., Kratochvíl, J.: Partial covers of graphs. Discussiones Mathematicae Graph Theory 22, 89-99 (2002)
9. Fiala, J., Kratochvíl, J., Kloks, T.: Fixed-parameter complexity of λ-labelings. Discrete Applied Mathematics 113(1), 59-72 (2001)
10. Fiala, J., Kratochvíl, J., Pór, A.: On the computational complexity of partial covers of theta graphs. Electronic Notes in Discrete Mathematics 19, 79-85 (2005)
11. Fiala, J., Kratochvíl, J., Proskurowski, A.: Distance Constrained Labeling of Precolored Trees. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202, pp. 285-292. Springer, Heidelberg (2001)
12. Fiala, J., Kratochvíl, J., Proskurowski, A.: Systems of distant representatives. Discrete Applied Mathematics 145(2), 306-316 (2005)
13. Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman and Co., New York (1979)
14. Golovach, P.A.: Systems of pair of q-distant representatives and graph colorings (in Russian). Zap. nau. sem. POMI 293, 5-25 (2002)
15. Griggs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM Journal of Discrete Mathematics 5(4), 586-595 (1992)
16. Harary, F.: Graph theory. Addison-Wesley Series in Mathematics IX (1969)
17. Leese, R.A.: A fresh look at channel assignment in uniform networks. In: EMC 1997 Symposium, Zurich, pp. 127-130 (1997)
18. Leese, R.A.: Radio spectrum: a raw material for the telecommunications industry. In: 10th Conference of the European Consortium for Mathematics in Industry, Goteborg (1998)
19. Leese, R.A., Noble, S.D.: Cyclic labellings with constraints at two distances. Electr. J. Comb. 11(1) (2004)
20. Liu, D.D.-F., Zhu, X.: Circulant distant two labeling and circular chromatic number. Ars Combinatoria 69, 177-183 (2003)
21. Matoušek, J., Nešetřil, J.: Invitation to Discrete Mathematics. Oxford University Press, Oxford (1998)
22. McDiarmid, C.: Discrete mathematics and radio channel assignment. In: Recent advances in algorithms and combinatorics. CMS Books Math./Ouvrages Math. SMC, vol. 11, pp. 27-63. Springer, Heidelberg (2003)
23. Yeh, R.K.: A survey on labeling graphs with a condition at distance two. Discrete Mathematics 306(12), 1217-1231 (2006)