On the complexity of some colorful problems parameterized by treewidth

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

Volumn 4616 LNCS, Issue , 2007, Pages 366-377

  Fellows, Michael ^a   Fomin, Fedor V ^b   Lokshtanov, Daniel ^b   Rosamond, Frances ^a   Saurabh, Saket ^b,c   Szeider, Stefan ^d   Thomassen, Carsten ^e  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b UNIVERSITY OF BERGEN   (Norway)

^c INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^d DURHAM UNIVERSITY   (United Kingdom)

^e TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PARAMETERIZATION; PROBLEM SOLVING;

ASSIGNMENT PROBLEMS; GRAPH COLORING; TREEWIDTH;

TREES (MATHEMATICS);

EID: 38149082727     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73556-4_38     Document Type: Conference Paper

References (23)

1. Alon, N.: Restricted colorings of graphs. In: Walker, K. (ed.) Surveys in Combinatorics 1993. London Math. Soc. Lecture Notes Series, vol. 187, pp. 1-33. Cambridge Univ. Press, Cambridge (1993)
2. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12, 308-340 (1991)
3. Bodlaender, H.L., Fomin, F.V.: Equitable colorings of bounded treewidth graphs. Theoretical Computer Science 349, 22-30 (2005)
4. Bodlaender, H.L., Fellows, M., Langston, M., Ragan, M.A., Rosamond, F., Weyer, M.: Quadratic kernelization for convex recoloring of trees. In: Proceedings COCOON 2007. LNCS, Springer, Heidelberg (to appear)
5. Borie, R.B., Parker, R.G., Tovey, C.A.: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively generated graph families. Algorithmica 7, 555-S81 (1992)
6. Chor, B., Fellows, M., Ragan, M.A., Razgon, I., Rosamond, F., Snir, S.: Connected coloring completion for general graphs: algorithms and complexity. In: Proceedings COCOON 2007. LNCS, Springer, Heidelberg (to appear)
7. Courcelle, B.: The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85, 12-75 (1990)
8. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
9. Erdös, P., Rubin, A.L., Taylor, H.: Choosability in graphs. Congressus Numerantium 26, 122-157 (1980)
10. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
11. Fellows, M., Giannopoulos, P., Knauer, C., Paul, C., Rosamond, F., Whitesides, S., Yu, N.: The lawnmower and other problems: applications of MSO logic in geometry. Manuscript (2007)
12. Fellows, M., Hermelin, D., Rosamond, F.: On the fixed-parameter intractability and tractability of multiple-interval graph properties. Manuscript (2007)
13. Jansen, K., Scheffler, P.: Generalized colorings for tree-like graphs. Discrete Applied Mathematics 75, 135-155 (1997)
14. Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley Interscience, Chichester (1995)
15. Kostochka, A.V., Pelsmajer, M.J., West, D.B.: A list analogue of equitable coloring. Journal of Graph Theory 44, 166-177 (2003)
16. Kratochvil, J., Tuza, Z., Voigt, M.: New trends in the theory of graph colorings: choosability and list coloring. In: Graham, R., et al. (eds.) Contemporary Trends in Discrete Mathematics (from DIMACS and DIMATIA to the future), AMS, Providence. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49, pp. 183-197 (1999)
17. Marx, D.: Graph coloring with local and global constraints. Ph.D. dissertation, Department of Computer Science and Information Theory, Budapest University of Technology and Economics (2004)
18. Meyer, W.: Equitable coloring. American Mathematical Monthly 80, 920-922 (1973)
19. Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford University Press, Oxford (2006)
20. Thomassen, C.: Every planar graph is 5-choosable. J. Combinatorial Theory Ser. B 62, 180-181 (1994)
21. Tuza, Z.: Graph colorings with local constraints -A survey. Discussiones Mathematicae - Graph Theory 17, 161-228 (1997)
22. Vizing, V.G.: Coloring the vertices of a graph in prescribed colors (in Russian). Metody Diskret. Anal. v Teorii Kodov i Schem 29, 3-10 (1976)
23. Woodall, D.R.: List colourings of graphs. In: Hirschfeld, J.W.P. (ed.) Surveys in Combinatorics 2001. London Math. Soc. Lecture Notes Series, vol. 288, pp. 269-301. Cambridge Univ. Press, Cambridge (2001)