Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
From MaRDI portal
This page was built for publication: Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7203175)