78 citations · 133 across the 7 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.CC2023
Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
Marek Filakovský, Tamio-Vesa Nakajima, Jakub Opršal +2
A linearly ordered (LO) -colouring of a hypergraph is a colouring of its vertices with colours such that each edge contains a unique maximal colour. Deciding wheth…
cs.LO2023★ 14 cited
Local consistency as a reduction between constraint satisfaction problems
Victor Dalmau, Jakub Opršal
We study the use of local consistency methods as reductions between constraint satisfaction problems (CSPs), and promise version thereof, with the aim to classify these reductions…