On the Complexity of Graph Critical Uncolorability

Jin-yi Cai, Gabriele E. Meyer. On the Complexity of Graph Critical Uncolorability. In Thomas Ottmann, editor, Automata, Languages and Programming, 14th International Colloquium, ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings. Volume 267 of Lecture Notes in Computer Science, pages 394-403, Springer, 1987.

@inproceedings{CaiM87,
  title = {On the Complexity of Graph Critical Uncolorability},
  author = {Jin-yi Cai and Gabriele E. Meyer},
  year = {1987},
  tags = {graph-rewriting, e-science, rewriting},
  researchr = {https://researchr.org/publication/CaiM87},
  cites = {0},
  citedby = {0},
  pages = {394-403},
  booktitle = {Automata, Languages and Programming, 14th International Colloquium, ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings},
  editor = {Thomas Ottmann},
  volume = {267},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-18088-5},
}