Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy (Q2285091): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2966381141 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:15, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy |
scientific article |
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
