Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference35 articles.
1. Parameterized complexity of vertex colouring;Cai;Discrete Appl. Math.,2003
2. Fixed-parameter tractability of graph modification problems for hereditary properties;Cai;Inform. Process. Lett.,1996
3. Vertex coloring of comparability+ke and −ke graphs;Takenaga,2006
4. Chordal deletion is fixed-parameter tractable;Marx,2006
5. J. Guo, F. Hüffner, R. Niedermeier, A structural view on parameterizing problems: Distance from triviality, in: First International Workshop on Parameterized and Exact Computation, IWPEC 2004, in: LNCS Proceedings, Springer, pp. 162–173
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献