A coalition in a graph G = (V, E) consists of two disjoint sets of vertices V 1 and V 2 , neither of which is a dominating set of G but whose union
No takes yet. Share an insight, caveat, or question.
Haynes et al. (2021) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: