A graph G is well-covered if every maximal independent set of maximum. (k,ℓ)-partition a partition its vertex into k sets and ℓ cliques. (k,ℓ)-well-covered it admits (k,ℓ)-partition. The recognition graphs polynomial-time solvable for the cases (0,1), (0,2), (1,0), (1,1), (1,2), (2,0), hard, otherwise. In sandwich problem property Π, we are given pair G1=(V,E1) G2=(V,E2) with E1⊆E2, asked wheth...
