The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness

From MaRDI portal

(Redirected from The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness)

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=The_graph_tessellation_cover_number:_chromatic_bounds,_efficient_algorithms_and_hardness&oldid=72322245"