We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Containment relations in split graphs.

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.

Item Type:Article
Keywords:Subgraph, Minor, Topological minor, Contraction.
Full text:Full text not available from this repository.
Publisher Web site:
Date accepted:No date available
Date deposited:No date available
Date of first online publication:January 2012
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar