Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy (Q2661991)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy |
scientific article; zbMATH DE number 7331686
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy |
scientific article; zbMATH DE number 7331686 |
Statements
Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy (English)
0 references
8 April 2021
0 references
hereditary graph class
0 references
induced subgraph
0 references
clique-width
0 references
graph isomorphism
0 references
0 references
0 references
0.88416016
0 references
0.88416016
0 references
0 references
0 references
0.8740788
0 references
0.87404364
0 references
0.8739486
0 references
