Complexity of Graph Partition Problems

Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani. Complexity of Graph Partition Problems. In STOC. pages 464-472, 1999. [doi]

@inproceedings{FederHKM99,
  title = {Complexity of Graph Partition Problems},
  author = {Tomás Feder and Pavol Hell and Sulamita Klein and Rajeev Motwani},
  year = {1999},
  doi = {10.1145/301250.301373},
  url = {http://doi.acm.org/10.1145/301250.301373},
  tags = {graph-rewriting, rewriting, partitioning},
  researchr = {https://researchr.org/publication/FederHKM99},
  cites = {0},
  citedby = {0},
  pages = {464-472},
  booktitle = {STOC},
}