Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances

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=Finding_paths_between_graph_colourings:_PSPACE-completeness_and_superpolynomial_distances&oldid=69472428"