An Approximation Algorithm for 3-Colourability

Ingo Schiermeyer. An Approximation Algorithm for 3-Colourability. In Manfred Nagl, editor, Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG 95, Aachen, Germany, June 20-22, 1995, Proceedings. Volume 1017 of Lecture Notes in Computer Science, pages 146-151, Springer, 1995.

@inproceedings{Schiermeyer95,
  title = {An Approximation Algorithm for 3-Colourability},
  author = {Ingo Schiermeyer},
  year = {1995},
  researchr = {https://researchr.org/publication/Schiermeyer95},
  cites = {0},
  citedby = {0},
  pages = {146-151},
  booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG  95, Aachen, Germany, June 20-22, 1995, Proceedings},
  editor = {Manfred Nagl},
  volume = {1017},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-60618-1},
}