On the Computational Complexity of the Forcing Chromatic Number

Frank Harary, Wolfgang Slany, Oleg Verbitsky. On the Computational Complexity of the Forcing Chromatic Number. In Volker Diekert, Bruno Durand, editors, STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings. Volume 3404 of Lecture Notes in Computer Science, pages 182-193, Springer, 2005. [doi]

Abstract

Abstract is missing.