Parameterized complexity of coloring problems: Treewidth versus vertex cover

Theoretical Computer Science

Volumn 412, Issue 23, 2011, Pages 2513-2523

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

^a CHARLES UNIVERSITY   (Czech Republic)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Graph colorings; Graph labelings; Parameterized complexity; Vertex cover

Indexed keywords

CHANNEL ASSIGNMENT; COLORING PROBLEMS; EQUITABLE COLORING; FIXED-PARAMETER COMPLEXITY; GRAPH COLORINGS; GRAPH LABELINGS; LIST COLORING; PARAMETERIZED; PARAMETERIZED COMPLEXITY; PARAMETRIZATIONS; PRECOLORING EXTENSION; TREE-WIDTH; VERTEX COVER;

COLORING; PARAMETERIZATION;

GRAPH THEORY;

EID: 79954591049     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.10.043     Document Type: Article

References (29)

1. K. Aardal, R. Weismantel, and L.A. Wolsey Non-standard approaches to integer programming Discrete Appl. Math. 123 2002 5 74
2. G. Agnarsson, and M.M. Halldrsson Coloring powers of planar graphs SIAM J. Discrete Math. 16 2003 651 662
3. N. Alon Restricted colorings of graphs Surveys in Combinatorics (Keele) London Math. Soc. Lecture Note Ser. vol. 187 1993 Cambridge University Press Cambridge 1 33
4. H.L. Bodlaender Treewidth: Characterizations, applications, and computations F.V. Fomin, Graph-Theoretic Concepts in Computer Science, Proceedings WG 2006 Lecture Notes in Computer Science vol. 4271 2006 Springer 1 14 (Pubitemid 44923291)
5. H.L. Bodlaender, and F.V. Fomin Equitable colorings of bounded treewidth graphs Theoret. Comput. Sci. 349 2005 22 30 (Pubitemid 41653469)
6. H.L. Bodlaender, and A.M.C.A. Koster Combinatorial optimization on graphs of bounded treewidth Comput. J. 51 2008 255 269 (Pubitemid 351649933)
7. J.F. Buss, and J. Goldsmith Nondeterminism within P SIAM J. Comput. 22 1993 560 572 (Pubitemid 23684998)
8. T. Calamoneri The l (h, k ) -labelling problem: a survey and annotated bibliography Comput. J. 49 2006 585 608 (Pubitemid 44592705)
9. G.J. Chang, and D. Kuo The L (2, 1 ) -labeling problem on graphs SIAM J. Discrete Math. 9 1996 309 316
10. M. Dom, D. Lokshtanov, S. Saurabh, and Y. Villanger Capacitated domination and covering: A parameterized perspective M. Grohe, R. Niedermeier, Parameterized and Exact Computation, Proceedings of IWPEC 2008 Lecture Notes in Computer Science vol. 5018 2008 Springer 78 90 (Pubitemid 351775561)
11. R.G. Downey, and M.R. Fellows Parameterized complexity Monographs in Computer Science 1999 Springer-Verlag New York
12. R.G. Downey, and M.R. Fellows Fixed-parameter tractability and completeness. II. On completeness for W [ 1 ] Theoret. Comput. Sci. 141 1995 109 131
13. Z. Dvok, D. Krl, P. Nejedl, and R. krekovski Coloring squares of planar graphs with girth six European J. Combin. 29 2008 838 849
14. Z. Dvok, R. krekovski, and M. Tancer List-coloring squares of sparse subcubic graphs SIAM J. Discrete Math. 22 2008 139 159
15. M. Fellows, D. Lokshtanov, N. Misra, F.A. Rosamond, and S. Saurabh Graph layout problems parameterized by vertex cover S.-H. Hong, H. Nagamochi, T. Fukunaga, Algorithms and Computation, Proceedings of ISAAC 2008 Lecture Notes in Computer Science vol. 5369 2008 Springer 294 305
16. M.R. Fellows, F.V. Fomin, D. Lokshtanov, F.A. Rosamond, S. Saurabh, S. Szeider, and C. Thomassen On the complexity of some colorful problems parameterized by treewidth A.W.M. Dress, Y. Xu, B. Zhu, Combinatorial Optimization and Applications, Proceedings of COCOA 2007 Lecture Notes in Computer Science vol. 4616 2007 Springer 366 377
17. J. Fiala, P.A. Golovach, and J. Kratochvl Distance constrained labelings of graphs of bounded treewidth L. Caires, G.F. Italiano, L. Monteiro, C. Palamidessi, M. Yung, Automata, Languages and Programming, Proceedings of ICALP 2005 Lecture Notes in Computer Science vol. 3580 2005 Springer 360 372 (Pubitemid 41436115)
18. J. Fiala, P.A. Golovach, and J. Kratochvl Computational complexity of the distance constrained labeling problem for trees (extended abstract) L. Aceto, I. Damgrd, L.A. Goldberg, M.M. Halldrsson, A. Inglfsdttir, I. Walukiewicz, Automata, Languages and Programming, Proceedings of ICALP 2008 Lecture Notes in Computer Science vol. 5125 2008 Springer 294 305
19. J. Fiala, P.A. Golovach, and J. Kratochvl Parameterized complexity of coloring problems: treewidth versus vertex cover J. Chen, S.B. Cooper, Theory and Applications of Models of Computation, Proceedings of TAMC 2009 Lecture Notes in Computer Science vol. 5532 2009 Springer 221 230
20. A. Frank, and Tardos An application of simultaneous Diophantine approximation in combinatorial optimization Combinatorica 7 1987 49 65
21. M.R. Garey, and D.S. Johnson Computers and intractability A Guide to the Theory of NP-completeness A Series of Books in the Mathematical Sciences 1979 W. H. Freeman and Co San Francisco, Calif
22. P.A. Golovach Systems of pairs of q-distant representatives, and graph colorings Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) 293 2002 5 25 181
23. T. Hasunuma, T. Ishii, H. Ono, and Y. Uno A linear time algorithm for L(2, 1)-labeling of trees A. Fiat, P. Sanders, Algorithms ESA 2009, Proceedings of ESA 2009 Lecture Notes in Computer Science vol. 5757 2009 Springer 35 46
24. R. Kannan Minkowski's convex body theorem and integer programming Math. Oper. Res. 12 1987 415 440
25. H.W. Lenstra Jr. Integer programming with a fixed number of variables Math. Oper. Res. 8 1983 538 548 (Pubitemid 14490611)
26. C. McDiarmid, and B. Reed Channel assignment on graphs of bounded treewidth Discrete Math. 273 2003 183 192
27. Z. Tuza Graph colorings with local constraintsa survey Discuss. Math. Graph Theory 17 1997 161 228
28. R.K. Yeh A survey on labeling graphs with a condition at distance two Discrete Math. 306 2006 1217 1231 (Pubitemid 44208821)
29. X. Zhou, Y. Kanari, and T. Nishizeki Generalized vertex-coloring of partial k-trees IEICE Trans. Fundamentals Electron. Commun. Comput. Sci. E83-A 2000 671 678