Max-leaves spanning tree is APX-hard for cubic graphs

From MaRDI portal

(Redirected from Publication:414465)

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=Max-leaves_spanning_tree_is_APX-hard_for_cubic_graphs&oldid=61672320"