Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width

From MaRDI portal

Jump to:navigation, search

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Characterizing_the_complexity_of_subgraph_isomorphism_for_graphs_of_bounded_path-width&oldid=89664596"