Graph Isomorphism for (H_1,H_2)-free Graphs: An Almost Complete Dichotomy

11/29/2018
by   Marthe Bonamy, et al.
0

We consider the Graph Isomorphism problem for classes of graphs characterized by two forbidden induced subgraphs H_1 and H_2. By combining old and new results, Schweitzer settled the computational complexity of this problem restricted to (H_1,H_2)-free graphs for all but a finite number of pairs (H_1,H_2), but without explicitly giving the number of open cases. Grohe and Schweitzer proved that Graph Isomorphism is polynomial-time solvable on graph classes of bounded clique-width. By combining previously known results for Graph Isomorphism with known results for boundedness of clique-width, we reduce the number of open cases to 14. By proving a number of new results we then further reduce this number to seven. By exploiting the strong relationship between Graph Isomorphism and clique-width, we also prove that the class of (gem,P_1+2P_2)-free graphs has unbounded clique-width. This reduces the number of open cases for boundedness of clique-width for (H_1,H_2)-free graphs to five.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/05/2020

Clique-Width: Harnessing the Power of Atoms

Many NP-complete graph problems are polynomially solvable on graph class...
research
05/21/2018

Colouring Square-Free Graphs without Long Induced Paths

The complexity of Colouring is fully understood for H-free graphs, but ...
research
07/22/2016

Hereditary Graph Classes: When the Complexities of Colouring and Clique Cover Coincide

A graph is (H_1,H_2)-free for a pair of graphs H_1,H_2 if it contains no...
research
11/23/2017

Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes

Daligault, Rao and Thomassé asked whether every hereditary graph class t...
research
11/05/2020

MSO Undecidability for some Hereditary Classes of Unbounded Clique-Width

Seese's conjecture for finite graphs states that monadic second-order lo...
research
06/01/2018

The Complexity of Bisimulation and Simulation on Finite Systems

In this paper the computational complexity of the (bi)simulation problem...
research
08/17/2020

A unified algorithm for colouring graphs of bounded clique-width

Clique-width is one of the graph complexity measures leading to polynomi...

Please sign up or login with your details

Forgot password? Click here to reset