Exact-Four-Colorability, Exact Domatic Number Problems, and the Boolean Hierarchy

Author Jörg Rothe

Thumbnail PDF


  • Filesize: 358 kB
  • 18 pages

Document Identifiers

Author Details

Jörg Rothe

Cite AsGet BibTex

Jörg Rothe. Exact-Four-Colorability, Exact Domatic Number Problems, and the Boolean Hierarchy. In Algebraic Methods in Computational Complexity. Dagstuhl Seminar Proceedings, Volume 4421, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)


This talk surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP. In particular, we show that it is DP-complete to decide whether or not a given graph can be colored with exactly four colors. DP is the second level of the boolean hierarchy. This result solves a question raised by Wagner in his 1987 TCS paper; its proof uses a clever reduction by Guruswami and Khanna. Similar results on various versions of the exact domatic number problem are also discussed. The result on Exact-Four-Colorability appeared in IPL, 2003. The results on exact domatic number problems, obtained jointly with Tobias Riege, are to appear in TOCS.
  • Exact Colorability
  • exact domatic number
  • boolean hierarchy completeness


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail