Parameterized coloring problems on chordal graphs

Theoretical Computer Science

Volumn 351, Issue 3, 2006, Pages 407-424

  Marx, Dániel ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

Chordal graphs; Coloring; Interval graphs; Parameterized complexity; Precoloring extension

Indexed keywords

COLOR; COLORING; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; POLYNOMIALS; PROBLEM SOLVING;

CHORDAL GRAPHS; INTERVAL GRAPHS; PARAMETERIZED COMPLEXITY; PRECOLORING EXTENSION;

GRAPH THEORY;

EID: 32144440332     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.10.008     Document Type: Conference Paper

References (23)

1. N. Alon, R. Yuster, and U. Zwick Finding and counting given length cycles Algorithmica 17 3 1997 209 223
2. M. Biró, M. Hujter, and Zs. Tuza Precoloring extension. I. Interval graphs Discrete Math. 100 1-3 1992 267 279
3. B. Bollobás On generalized graphs Acta Math. Acad. Sci. Hungar. 16 1965 447 452
4. L. Cai Fixed-parameter tractability of graph modification problems for hereditary properties Inform. Process. Lett. 58 4 1996 171 176
5. L. Cai Parameterized complexity of vertex colouring Discrete Appl. Math. 127 2003 415 429
6. J. Chen, B. Chor, M. Fellows, X. Huang, D. Juedes, I. Kanj, and G. Xia Tight lower bounds for certain parameterized NP-hard problems Proc. of the 19th Annu. IEEE Conf. on Computational Complexity 2004 150 160
7. R.G. Downey, and M.R. Fellows Parameterized complexity, Monographs in Computer Science 1999 Springer New York
8. M.C. Golumbic Algorithmic Graph Theory and Perfect Graphs 1980 Academic Press New York
9. M. Grohe, J. Flum, Parameterized complexity and subexponential time, Bull. Eur. Assoc. Theoret. Comput. Sci. EATCS (84) (2004) 71-100.
10. J. Guo, F. Hüffner, R. Niedermeier, A structural view on parameterizing problems: distance from triviality, in: Proc. of Internat. Workshop on Parameterized and Exact Computation (IWPEC 2004), Lecture Notes in Computer Science, Vol. 3162, Springer, Berlin, 2004, pp. 162-173.
11. M. Hujter, and Zs. Tuza Precoloring extension. II. Graph classes related to bipartite graphs Acta Math. Univ. Comenian. 62 1 1993 1 11
12. M. Hujter, and Zs. Tuza Precoloring extension. III. Classes of perfect graphs Combin. Probab. Comput. 5 1 1996 35 56
13. H. Kaplan, R. Shamir, and R.E. Tarjan Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs SIAM J. Comput. 28 5 1999 1906 1922
14. T. Kloks, Treewidth, Lecture Notes in Computer Science, Vol. 842, Springer, Berlin, 1994.
15. D. König Über graphen und ihre andwendung auf determinantentheorie und mengenlehre Math. Ann. 77 1916 453 465
16. D. Marx, Precoloring extension on chordal graphs, 2004, Manuscript (Preliminary version presented at Graph Theory 2004, Paris).
17. D. Marx, Precoloring extension on unit interval graphs, to appear in Discrete Applied Mathematics.
18. B. Monien, How to find long paths efficiently, in: Analysis and Design of Algorithms for Combinatorial Problems (Udine, 1982), North-Holland Mathematical Studies, Vol. 109, North-Holland, Amsterdam, 1985, pp. 239-254.
19. R. Niedermeier, Invitation to fixed-parameter algorithms, Habilitation Thesis, Universität Tübingen, 2002.
20. B. Reed Edge coloring nearly bipartite graphs Oper. Res. Lett. 24 1-2 1999 11 14
21. B. Reed, K. Smith, and A. Vetta Finding odd cycle transversals Oper. Res. Lett. 32 4 2004 299 301
22. D.J. Rose, R.E. Tarjan, and G.S. Lueker Algorithmic aspects of vertex elimination on graphs SIAM J. Comput. 5 2 1976 266 283
23. A. Slivkins, Parameterized tractability of edge-disjoint paths on directed acyclic graphs, in: Algorithms - ESA 2003, 11th Annu. European Symp., Lecture Notes in Computer Science, Vol. 2832, Springer, Berlin, 2003, pp. 482-493.