Graph isomorphism for \((H 1,H 2)\)-free graphs: an almost complete dichotomy

From MaRDI portal

(Redirected from Publication:2285091)
Graph isomorphism for \((H 1,H 2)\)-free graphs: an almost complete dichotomy

Jump to:navigation, search

WRNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Graph_isomorphism_for_%5C((H_1,H_2)%5C)-free_graphs:_an_almost_complete_dichotomy&oldid=71764677"