@InProceedings{filakovsky_et_al:LIPIcs.STACS.2024.34,
author = {Filakovsk\'{y}, Marek and Nakajima, Tamio-Vesa and Opr\v{s}al, Jakub and Tasinato, Gianluca and Wagner, Uli},
title = {{Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {34:1--34:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.34},
URN = {urn:nbn:de:0030-drops-197445},
doi = {10.4230/LIPIcs.STACS.2024.34},
annote = {Keywords: constraint satisfaction problem, hypergraph colouring, promise problem, topological methods}
}