Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs

Marek Filakovský, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner 0001. Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs. In Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov, editors, 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France. Volume 289 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. [doi]

Abstract

Abstract is missing.