We give a constructive characterization of trees that have a maximum independent set and a minimum dominating set which are disjoint and show that the corresponding decision problem is NP-complete for general graphs.
Zitier-Link kopieren
Document-Link
https://www.db-thueringen.de/receive/dbt_mods_00010404
Nutzung und Vervielfältigung: Alle Rechte vorbehalten