Detecting Induced Minors in AT-Free Graphs

The problem Induced Minor is to test whether a graph G can be modified into a graph H by a sequence of vertex deletions and edge contractions. We prove that Induced Minor is polynomial-time solvable when G is AT-free, and H is fixed, i.e., not part of the input. Our result can be considered to be optimal in some sense as we also prove that Induced Minor is W[1]-hard on AT-free graphs, when parameterized by |V H |. In order to obtain it we prove that the Set-Restricted k -Disjoint Paths problem can be solved in polynomial time on AT-free graphs for any fixed k. We also use the latter result to prove that the Set-Restricted k -Disjoint Connected Subgraphs problem is polynomial-time solvable on AT-free graphs for any fixed k.

[1]  Dieter Kratsch,et al.  Approximating the Bandwidth for Asteroidal Triple-Free Graphs , 1999, J. Algorithms.

[2]  Frank Harary,et al.  Graph Theory , 2016 .

[3]  Dimitrios M. Thilikos,et al.  Contraction checking in graphs on surfaces , 2012, STACS.

[4]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[5]  Paul Wollan,et al.  Finding topological subgraphs is fixed-parameter tractable , 2010, STOC '11.

[6]  Gerhard J. Woeginger,et al.  Partitioning graphs into connected parts , 2009, Theor. Comput. Sci..

[7]  Michael R. Fellows,et al.  The complexity of induced minors and related problems , 1995, Algorithmica.

[8]  Gerhard J. Woeginger,et al.  The computational complexity of graph contractions II: Two tough polynomially solvable cases , 2008, Networks.

[9]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[10]  Jirí Fiala,et al.  Detecting induced star-like minors in polynomial time , 2012, J. Discrete Algorithms.

[11]  Jirí Fiala,et al.  A note on contracting claw-free graphs , 2013, Discret. Math. Theor. Comput. Sci..

[12]  Gerhard J. Woeginger,et al.  The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases , 2008 .

[13]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[14]  Alan P. Sprague,et al.  Disjoint Paths in Circular Arc Graphs , 1996, Nord. J. Comput..

[15]  Stephan Olariu,et al.  Asteroidal Triple-Free Graphs , 1993, SIAM J. Discret. Math..

[16]  Gerhard J. Woeginger,et al.  The computational complexity of graph contractions I: Polynomially solvable and NP‐complete cases , 2008, Networks.

[17]  Robin Thomas,et al.  On the complexity of finding iso- and other morphisms for partial k-trees , 1992, Discret. Math..

[18]  Stephan Olariu,et al.  Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs , 1995, SIAM J. Comput..

[19]  Petr A. Golovach,et al.  Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths , 2011, ISAAC.

[20]  Erik Jan van Leeuwen,et al.  Induced Disjoint Paths in AT-Free Graphs , 2012, SWAT.

[21]  C. Lekkeikerker,et al.  Representation of a finite graph by a set of intervals on the real line , 1962 .

[22]  Pim van 't Hof,et al.  On graph contractions and induced minors , 2012, Discret. Appl. Math..

[23]  B. Mohar,et al.  Graph Minors , 2009 .

[24]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[25]  Andries E. Brouwer,et al.  Contractibility and NP-completeness , 1987, J. Graph Theory.

[26]  M. Krom.  The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary , 1967 .