The complexity of some graph colouring problems

Keith Edwards. The complexity of some graph colouring problems. Discrete Applied Mathematics, 36(2):131-140, 1992. [doi]

@article{Edwards92,
  title = {The complexity of some graph colouring problems},
  author = {Keith Edwards},
  year = {1992},
  doi = {10.1016/0166-218X(92)90227-2},
  url = {http://dx.doi.org/10.1016/0166-218X(92)90227-2},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Edwards92},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {36},
  number = {2},
  pages = {131-140},
}