Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems - a Survey

Tobias Riege, Jörg Rothe. Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems - a Survey. J. UCS, 12(5):551-578, 2006. [doi]

@article{RiegeR06,
  title = {Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems - a Survey},
  author = {Tobias Riege and Jörg Rothe},
  year = {2006},
  url = {http://www.jucs.org/jucs_12_5/completenes_in_the_boolean},
  tags = {completeness, graph-rewriting, survey, rewriting},
  researchr = {https://researchr.org/publication/RiegeR06},
  cites = {0},
  citedby = {0},
  journal = {J. UCS},
  volume = {12},
  number = {5},
  pages = {551-578},
}