Graph Isomorphism for $(H_1,H_2)$-free Graphs: An Almost Complete Dichotomy
From MaRDI portal
Publication:6310429
DOI10.1007/s00453-020-00747-xzbMath1512.68195arXiv1811.12252MaRDI QIDQ6310429
Konrad K. Dabrowski, Marthe Bonamy, Nicolas Bousquet, Matthew Johnson, Théo Pierron, Daniël Paulusma
Publication date: 29 November 2018
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)