On the complexity of finding iso- and other morphisms for partial k-trees
Discrete Mathematics - Topological, algebraical and combinatorial structures; Froli´k's memorial volume
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Induced Subgraph Isomorphism for Cographs in NP-Complete
WG '90 Proceedings of the 16rd International Workshop on Graph-Theoretic Concepts in Computer Science
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Discrete Applied Mathematics
Contractions of planar graphs in polynomial time
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Finding topological subgraphs is fixed-parameter tractable
Proceedings of the forty-third annual ACM symposium on Theory of computing
Edge contractions in subclasses of chordal graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Contracting a chordal graph to a split graph or a tree
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
The k-in-a-Path Problem for Claw-free Graphs
Algorithmica
On graph contractions and induced minors
Discrete Applied Mathematics
Finding contractions and induced minors in chordal graphs via disjoint paths
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Edge contractions in subclasses of chordal graphs
Discrete Applied Mathematics
Hi-index | 0.04 |
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.