A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary

From MaRDI portal
Revision as of 14:43, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5146828