We almost completely resolve the computational complexity of Graph Isomorphism for classes of graphs characterized by two forbidden induced subgraphs H1 and H2. Schweitzer settled the complexity of this problem restricted to (H1;H2)-free graphs for all but a nite number of pairs (H1;H2), but without explicitly giving the number of open cases. Grohe and Schweitzer proved that Graph Isomorphism is polynomialtime solvable on graph classes of bounded clique-width. By combining known results with a number of new results, we reduce the number of open cases to seven. By exploiting the strong relationship between Graph Isomorphism and clique-width, we simultaneously reduce the number of open cases for boundedness of clique-width for (H1;H2)-free gr...
A graph is H-free if it has no induced subgraph isomorphic to H. We continue a study into the bounde...
We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph H as...
A graph is H-free if it has no induced subgraph isomorphic to H. We continue a study into the bounde...
28 pages, 4 figuresWe resolve the computational complexity of Graph Isomorphism for classes of graph...
International audienceAbstract We resolve the computational complexity of Graph Isomorphism for clas...
International audienceAbstract We resolve the computational complexity of Graph Isomorphism for clas...
We resolve the computational complexity of GRAPH ISOMORPHISM for classes of graphs characterized by ...
We almost completely resolve the computational complexity of Graph Isomorphism for classes of graph...
In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the g...
The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures....
AbstractWe investigate the computational complexity of the following restricted variant of Subgraph ...
Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn’t b...
AbstractAn open question is the computational complexity of recognizing when two graphs are isomorph...
We generalize the structure theorem of Robertson and Sey-mour for graphs excluding a fixed graph H a...
We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph H as...
A graph is H-free if it has no induced subgraph isomorphic to H. We continue a study into the bounde...
We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph H as...
A graph is H-free if it has no induced subgraph isomorphic to H. We continue a study into the bounde...
28 pages, 4 figuresWe resolve the computational complexity of Graph Isomorphism for classes of graph...
International audienceAbstract We resolve the computational complexity of Graph Isomorphism for clas...
International audienceAbstract We resolve the computational complexity of Graph Isomorphism for clas...
We resolve the computational complexity of GRAPH ISOMORPHISM for classes of graphs characterized by ...
We almost completely resolve the computational complexity of Graph Isomorphism for classes of graph...
In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the g...
The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures....
AbstractWe investigate the computational complexity of the following restricted variant of Subgraph ...
Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn’t b...
AbstractAn open question is the computational complexity of recognizing when two graphs are isomorph...
We generalize the structure theorem of Robertson and Sey-mour for graphs excluding a fixed graph H a...
We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph H as...
A graph is H-free if it has no induced subgraph isomorphic to H. We continue a study into the bounde...
We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph H as...
A graph is H-free if it has no induced subgraph isomorphic to H. We continue a study into the bounde...