On the complexity of testing for odd holes and induced odd paths
Discrete Mathematics
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
Contractions of planar graphs in polynomial time
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
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
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
| Hi-index | 0.00 |
The Induced Minor problem is to test whether a graph G contains a graph H as an induced minor, i.e., if G can be modified into H by a sequence of vertex deletions and edge contractions. When H is fixed, i.e., not part of the input, this problem is denoted H-Induced Minor. We provide polynomial-time algorithms for this problem in the case that the fixed target graph has a star-like structure. In particular, we show polynomial-time solvability for all forests H on at most seven vertices except for one such case.