Does co-NP have short interactive proofs?
Information Processing Letters
Graph isomorphism is in the low hierarchy
Journal of Computer and System Sciences
The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
$O(M.N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
SIAM Journal on Computing
The isomorphism problem for directed path graphs and for rooted directed path graphs
Journal of Algorithms
A Linear Time Algorithm for Deciding Interval Graph Isomorphism
Journal of the ACM (JACM)
Complexity of Coloring Graphs without Forbidden Induced Subgraphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
Discrete Applied Mathematics
New Graph Classes of Bounded Clique-Width
Theory of Computing Systems
Note: A decidability result for the dominating set problem
Theoretical Computer Science
Isomorphism for graphs of bounded feedback vertex set number
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Structure theorem and isomorphism test for graphs with excluded topological subgraphs
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
List coloring in the absence of two subgraphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
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.