Graph isomorphism for graph classes characterized by two forbidden induced subgraphs

We study the complexity of the Graph Isomorphism problem on graph classes that are characterized by a finite number of forbidden induced subgraphs, focusing mostly on the case of two forbidden subgraphs. We show hardness results and develop techniques for the structural analysis of such graph classes, which applied to the case of two forbidden subgraphs give the following results: A dichotomy into isomorphism complete and polynomial-time solvable graph classes for all but finitely many cases, whenever neither of the forbidden graphs is a clique, a pan, or a complement of these graphs. Further reducing the remaining open cases we show that (with respect to graph isomorphism) forbidding a pan is equivalent to forbidding a clique of size three.

[1]  Zsolt Tuza,et al.  Complexity of Coloring Graphs without Forbidden Induced Subgraphs , 2001, WG.

[2]  I. Ponomarenko.  The isomorphism problem for classes of graphs closed under contraction , 1991 .

[3]  Dániel Marx,et al.  Structure theorem and isomorphism test for graphs with excluded topological subgraphs , 2011, STOC '12.

[4]  J. Köbler,et al.  The Graph Isomorphism Problem: Its Structural Complexity , 1993 .

[5]  Vadim V. Lozin,et al.  A decidability result for the dominating set problem , 2010, Theor. Comput. Sci..

[6]  Frank Plumpton Ramsey,et al.  On a Problem of Formal Logic , 1930 .

[7]  Kurt Mehlhorn,et al.  Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers , 2009 .

[8]  Shin-Ichi Nakano,et al.  A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs , 2007, Journal of Computer Science and Technology.

[9]  Derek G. Corneil,et al.  Complement reducible graphs , 1981, Discret. Appl. Math..

[10]  Gottfried Tinhofer,et al.  The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs , 1996, J. Algorithms.

[11]  Stathis Zachos,et al.  Does co-NP Have Short Interactive Proofs? , 1987, Inf. Process. Lett..

[12]  Feodor F. Dragan,et al.  New Graph Classes of Bounded Clique-Width , 2002, Theory of Computing Systems.

[13]  Ryuhei Uehara,et al.  Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs , 2005, Discret. Appl. Math..

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

[15]  Uwe Schning.  GRAPH ISOMORPHISM IS IN THE LOW HIERARCHY , 2022 .

[16]  L. Beineke.  Characterizations of derived graphs , 1970 .

[17]  Wen-Lian Hsu.  O(M*N) Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs , 1995, SIAM J. Comput..

[18]  László Babai,et al.  Canonical labeling of graphs , 1983, STOC.

[19]  Kellogg S. Booth,et al.  A Linear Time Algorithm for Deciding Interval Graph Isomorphism , 1979, JACM.

[20]  Stefan Kratsch,et al.  Isomorphism for Graphs of Bounded Feedback Vertex Set Number , 2010, SWAT.

[21]  Jacobo Torán,et al.  The graph isomorphism problem , 2020, Commun. ACM.

[22]  H. Whitney.  Congruent Graphs and the Connectivity of Graphs , 1932 .

[23]  Eugene M. Luks.  Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time , 1980, FOCS.