Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy (Q2285091)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7152209
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy |
scientific article; zbMATH DE number 7152209 |
Statements
Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy (English)
0 references
16 January 2020
0 references
hereditary graph class
0 references
induced subgraph
0 references
clique-width
0 references
graph isomorphism
0 references
0.9841423630714417
0 references
0.8673859238624573
0 references
0.8661059141159058
0 references
0.8376779556274414
0 references
0.8366710543632507
0 references
