Highly Influenced

@inproceedings{Cameron2004TheLP, title={The list partition problem for graphs}, author={Kathie Cameron and Elaine M. Eschen and Ch{\'i}nh T. Ho{\`a}ng and R. Sritharan}, booktitle={SODA}, year={2004} }

- Published 2004 in SODA

We consider the problem of partitioning the vertex-set of a graph into at most k parts A1, A2,..., Ak, where it may be specified that Ai induce a stable set, a clique, or an arbitrary subgraph, and pairs Ai, Aj (i ≠ j) be completely non-adjacent, completely adjacent, or arbitrarily adjacent. This problem is generalized to the list version which specifies for each vertex a list of parts in which the vertex is allowed to be placed. Many well-known graph problems can be formulated as list… CONTINUE READING

Highly Cited

This paper has 21 citations. REVIEW CITATIONS