Elegant distance constrained labelings of trees

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

Volumn 3353, Issue , 2004, Pages 58-67

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

^a CHARLES UNIVERSITY   (Czech Republic)

^b SYKTYVKAR STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

INDIUM COMPOUNDS; TREES (MATHEMATICS); FORESTRY; POLYNOMIAL APPROXIMATION;

ADJACENT VERTICES; COMPLEXITY ISSUES; DISTANCE CONSTRAINED LABELING; DISTANCE CONSTRAINTS; GRAPH LABELINGS; LABEL SPACE; LABELINGS; NEIGHBOURHOOD; POLYNOMIAL-TIME ALGORITHMS;

POLYNOMIAL APPROXIMATION; GRAPH THEORY;

EID: 35048860872     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30559-0_5     Document Type: Article

References (14)

1. ARNBORG, S., LAGERGREN, J., AND SEESE, D. Easy problems for tree-decomposable graphs. J. Algorithms 12, 2 (1991), 308-340.
2. BERTOSSI, A. A., PINOTTI, M. C., AND RIZZI, R. Channel assignment on strongly-simplicial graphs. In International Parallel and Distributed Processing Symposium, 17th IPDPS '03, Nice (2003), IEEE Computer Society, p. 222.
3. CHANG, G. J., AND Kuo, D. The L(2, 1)-labeling problem on graphs. SIAM Journal of Discrete Mathematics 9, 2 (May 1996), 309-316.
4. COURCELLE, B. The monadic second-order logic of graphs. I: Recognizable sets of finite graphs. Inf. Comput. 85, 1 (1990), 12-75.
5. FIALA, J., AND KRATOCHVÍL, J. Partial covers of graphs. Discussiones Mathematicae Graph Theory 22 (2002), 89-99.
6. FIALA, J., KRATOCHVÍL, J., AND PROSKUROWSKI, A. Distance constrained labelings of precolored trees. In Theoretical Computer Science, 7th ICTCS '01, Torino (2001), no. 2202 in Lecture Notes in Computer Science, Springer Verlag, pp. 285-292.
7. GOLOVACH, P. A. Systems of pair of q-distant representatives and graph colorings. Zap. nau. sem. POMI 293 (2002), 5-25. in Russian.
8. GRIGGS, J. R., AND YEH, R. K. Labelling graphs with a condition at distance 2. SIAM Journal of Discrete Mathematics 5, 4 (Nov 1992), 586-595.
9. KEARNEY, P. E., AND CORNEIL, D. G. Tree powers. Journal of Algorithms 29, 1 (Oct. 1998), 111-131.
10. KOHL, A., SCHREYER, J., TUZA, Z., AND VOIGT, M. Choosability problems for (d, s)-colorings. in preparation, 2003.
11. LEESE, R. A. Radio spectrum: a raw material for the telecommunications industry. 10th Conference of the European Consortium for Mathematics in Industry, Goteborg, 1998.
12. LIN, Y. L., AND SKIENA, S. S. Algorithms for square roots of graphs. SIAM Journal on Discrete Mathematics 8, 1 (Feb. 1995), 99-118.
13. SCHAEFER, T. J. The complexity of the satisfability problem. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing (1978), ACM, pp. 216-226.
14. VAN DEN HEUVEL, J., LEESE, R. A., AND SHEPHERD, M. A. Graph labeling and radio channel assignment. Journal of Graph Theory 29, 4 (1998), 263-283.