Cohabitation of independent sets and dominating sets in trees
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.