On Complexity of Colouring Mixed Hypertrees

Daniel Král. On Complexity of Colouring Mixed Hypertrees. In Rusins Freivalds, editor, Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings. Volume 2138 of Lecture Notes in Computer Science, pages 516-524, Springer, 2001. [doi]

Abstract

Abstract is missing.