Parameterized complexity of vertex colouring

Discrete Applied Mathematics

Volumn 127, Issue 3, 2003, Pages 415-429

  Cai, Leizhen ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Bipartite graph; Fixed parameter problem; Parameterized complexity; Split graph; Vertex colouring

Indexed keywords

EID: 84867950611     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00242-1     Document Type: Article

References (23)

1. S. Arnborg, D.G. Corneil, and A. Proskurowski Complexity of finding embeddings in a k-tree SIAM J. Algebraic Discrete Methods 8 1987 277 284
2. S. Arnborg, J. Lagergren, and D. Seese Easy problems for tree-decomposable graphs J. Algorithms 12 1991 308 340
3. S. Arnborg, and A. Proskurowski Linear time algorithms for NP-hard problems restricted to partial k-trees Discrete Appl. Math. 23 1989 11 24
4. H.L. Bodlaender A linear time algorithm for finding tree-decompositions of small treewidth SIAM J. Comput. 25 1996 1305 1317
5. H.L. Bodlaender, K. Jensen, and G.J. Woeginger Scheduling with incompatible jobs Discrete Appl. Math. 55 1994 219 232
6. L. Cai Fixed-parameter tractability of graph modification problems for hereditary properties Inform. Process. Lett. 58 1996 171 176
7. B. Courcelle Recognizability and second-order definability for sets of finite graphs Inform. and Comput. 85 1990 12 75
8. 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
9. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer Berlin
10. S. Földes, and P.L. Hammer Split graphs Congr. Numer. 19 1977 311 315
11. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-completeness 1979 Freeman San Francisco, CA
12. M.R. Garey, D.S. Johnson, and L. Stockmeyer Some simplified NP-complete graph problems Theoret. Comput. Sci. 1 1976 237 267
13. F. Gavril Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph SIAM J. Comput. 1 1972 180 187
14. M.C. Golumbic Algorithmic Graph Theory and Perfect Graphs 1980 Academic Press New York
15. P.L. Hammer, and B. Simeone The splittance of a graph Combinatorica 1 3 1981 275 284
16. T.W. Haynes, S.T. Hedetniemi, P.J. Slater (Eds.), Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
17. T.W. Haynes, S.T. Hedetniemi, P.J. Slater (Eds.), Domination in Graphs: Advanced Topics, Marcel Dekker, New York, 1998.
18. K. Jansen, and P. Scheffler Generalized coloring for tree-like graphs Discrete Appl. Math. 75 1997 135 155
19. D.S. Johnson The NP-completeness column: an ongoing guide (16) J. Algorithms 6 1985 434 451
20. 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 1906-1922 1999
21. T.R. Walsh Worst-case analysis of Read's chromatic polynomial algorithm Ars Combin 46 1997 145 151
22. D.B. West Introduction to Graph Theory 1996 Prentice-Hall New York
23. L. Cai, B. Schieber, A linear-time algorithm for computing the intersection of all odd cycles in a graph, Discrete Appl. Math. 73 (1997) 27-34.