Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy

DOI10.1007/978-3-030-24766-9_14OpenAlexW2966381141MaRDI QIDQ2285091

Matthew Johnson, Daniël Paulusma, Marthe Bonamy, Konrad K. Dabrowski

Publication date: 16 January 2020

Full work available at URL: http://dro.dur.ac.uk/28152/1/28152.pdf

zbMATH Keywords

induced subgraphclique-widthgraph isomorphismhereditary graph class

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Related Items (3)

Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy ⋮ Clique-Width for Graph Classes Closed under Complementation ⋮ Clique-width and well-quasi-ordering of triangle-free graph classes

This page was built for publication: Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy