Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm
From MaRDI portal
This page was built for publication: Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7189206)