Golovach, P.A. and Kaminski, M. and Paulusma, Daniel and Thilikos, D.M. (2012) 'Containment relations in split graphs.', Discrete applied mathematics., 160 (1-2). pp. 155-163.
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.
|Keywords:||Subgraph, Minor, Topological minor, Contraction.|
|Full text:||Full text not available from this repository.|
|Publisher Web site:||http://dx.doi.org/10.1016/j.dam.2011.10.004|
|Record Created:||07 Dec 2011 14:20|
|Last Modified:||03 Apr 2013 16:18|
|Social bookmarking:||Export: EndNote, Zotero | BibTex|
|Usage statistics||Look up in GoogleScholar | Find in a UK Library|