String graphs. II: Recognizing string graphs is NP-hard

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=String_graphs._II:_Recognizing_string_graphs_is_NP-hard&oldid=66152094"