2 citations · 3 across the 8 of their papers we have counts for
1 paper · 1 filter
Johan Håstad, Björn Martinsson, Tamio-Vesa Nakajima +1
A linearly ordered (LO) k-colouring of a hypergraph assigns to each vertex a colour from the set {0,1,…,k−1} in such a way that each hyperedge has a unique maximum eleme…