Distance constrained labelings of graphs of bounded treewidth

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 360-372

  Fiala, Jǐí ^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

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; TREES (MATHEMATICS);

GRAPH LABELING; TREEWIDTH;

GRAPH THEORY;

EID: 26444438099     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_30     Document Type: Conference Paper

References (25)

1. ARNBORG, S., AND PROSKUROWSKI, A. Characterization and recognition of partial k-trees Congr. Numerantium 47 (1985) 69-75.
2. BODLAENDER H. Polynomial algorithms for Graph Isomorphism and Chromatic Index on partial k-trees J. Algorithms 11 (1990) 631-643.
3. BODLAENDER H. A tourist guide through treewidth Acta Cybern. 11 (1993) 1-21.
4. 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.
5. COURCELLE, B. The monadic second-order logic of graphs. I: Recognizable sets of finite graphs. Inf. Comput. 85, 1 (1990), 12-75.
6. FELLOWS, M.R.; KRATOCHVÍL, J.; MIDDENDORF, M.; PFEIFFER, F. The complexity of induced minors and related problems Algorithmica 13 (1995) 266-282.
7. FIALA, J., KLOKS, T., AND KRATOCHVÍL, J. Fixed-parameter complexity of λ-labelings Discrete Applied Math. 113 (2001), 59-72.
8. FIALA, J., AND KRATOCHVÍL, J. Complexity of partial covers of graphs In: Algorithms and Computation (P.Eades and T.Takaoka, eds.), Proceedings ISAAC 2001, Christchurch, December 2001, Lecture Notes in Computer Science 2223, Springer Verlag, Berlin Heidelberg 2001, pp. 537-549
9. FIALA, J., AND KRATOCHVÍL, J. Partial covers of graphs Discussiones Mathematicae Graph Theory 22 (2002) 89-99.
10. 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.
11. FIALA, J., KRATOCHVÍL, J., AND PROSKUROWSKI, A. Systems of distant representatives. Discrete Applied Mathematics 145, 2 (2005), 306-316.
12. GAREY, M., GRAHAM, R., JOHNSON, D., AND KNUTH, D. Complexity results for bandwidth minimization. SIAM J. Appl. Math. 34 (1978), 477-495.
13. GAREY, M. R., AND JOHNSON, D. S. Computers and Intractability. W. H. Freeman and Co., New York, 1979.
14. GOLOVACH, P. A. Systems of pairs of q-distant representatives and graph colorings. Zap. nau. sem. POMI 293 (2002), 5-25. in Russian.
15. 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.
16. KRÁL, D., AND SKREKOVSKI, R. A theorem about the channel assignment problem SIAM J. Discrete Math. 16, No.3 (2003) 426-437.
17. LEESE, R. A., AND NOBLE, S. D. Cyclic labellings with constraints at two distances. Electr. J. Comb. 11, 1 (2004).
18. LIU, D., AND ZHU, X. Circular Distance Two Labelings and Circular Chromatic Numbers. Ars Combin. 69, 4 (2003), 177-183.
19. MCDIARMID, C., AND REED, B. Channel assignment on graphs of bounded treewidth. Discrete Math. 273, 1-3 (2003), 183-192.
20. MONIEN, B., AND SUDBOROUGH, I. H. Min Cut is NP-Complete for Edge Weigthed Trees Theor. Comput. Sci. 58, No. 1-3, (1988) 209-229.
21. ROBERTS, F.S. private communication to J. Griggs.
22. ROBERTSON, N., AND SEYMOUR, P. Graph minors. I. Excluding a forest. J. Comb. Theory, Ser. B 35 (1983), 39-61.
23. PROSKUROWSKI, A. Separating subgraphs in k-trees: cables and caterpillars. Discrete Math. 49 (1984), 275-285.
24. 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.
25. YANNAKAKIS, M. A polynomial algoritm for the min-cut linear arrangements of trees J. ACM 32 (1985) 950-988.