On the Complexity of Hop Domination and 2-Step Domination in Graph Classes

From MaRDI portal
















This page was built for publication: On the Complexity of Hop Domination and 2-Step Domination in Graph Classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7252442)