Fiala, J. and Kaminski, M. and Paulusma, D. (2013) 'A note on contracting claw-free graphs.', Discrete mathematics & theoretical computer science., 15 (2). pp. 223-232.
A graph containment problem is to decide whether one graph called the host graph can be modified into some other graph called the target 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 problems: testing on (induced) minors, (induced) topological minors, (induced) subgraphs, (induced) spanning subgraphs, dissolutions and contractions. We show that these problems stay NP-complete even when the host and target belong to the class of line graphs, which form a subclass of the class of claw-free graphs, i.e., graphs with no induced 4-vertex star. A natural question is to study the computational complexity of these problems if the target graph is assumed to be fixed. We show that these problems may become computationally easier when the host graphs are restricted to be claw-free. In particular we consider the problems that are to test whether a given host graph contains a fixed target graph as a contraction.
|Full text:||(VoR) Version of Record|
Download PDF (281Kb)
|Publisher Web site:||http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2128/4343|
|Date accepted:||No date available|
|Date deposited:||07 January 2015|
|Date of first online publication:||2013|
|Date first made open access:||No date available|
Save or Share this output
|Look up in GoogleScholar|