par Golovach, Petr A.;Kaminski, Marcin 
;Paulusma, Daniël;Thilikos Touloupas, Dimitrios
Référence Discrete applied mathematics, 160, 1-2, page (155-163)
Publication Publié, 2012
;Paulusma, Daniël;Thilikos Touloupas, Dimitrios Référence Discrete applied mathematics, 160, 1-2, page (155-163)
Publication Publié, 2012
Article révisé par les pairs
| Résumé : | A graph containment problem is to decide whether one graph can be modified into some other graph by using a number of specified graph operations. We consider edge deletions, edge contractions, vertex deletions and vertex dissolutions as possible graph operations permitted. By allowing any combination of these four operations we capture the following ten problems: testing on (induced) minors, (induced) topological minors, (induced) subgraphs, (induced) spanning subgraphs, dissolutions and contractions. A split graph is a graph whose vertex set can be partitioned into a clique and an independent set. Our results combined with existing results settle the parameterized complexity of all ten problems for split graphs. © 2011 Elsevier B.V. All rights reserved. |
