# Eschen, Elaine M.

## The stubborn list partition problem ★★

Author(s): Cameron; Eschen; Hoang; Sritharan

**Problem**Does there exist a polynomial time algorithm which takes as input a graph and for every vertex a subset of , and decides if there exists a partition of into so that only if and so that are independent, is a clique, and there are no edges between and ?

Keywords: list partition; polynomial algorithm