Linearly ordered colourings of hypergraphs

A linearly ordered (LO) k-colouring of an r-uniform hypergraph assigns an integer from {1, …, k} to every vertex so that, in every edge, the (multi)set of colours has a unique maximum. Equivalently, for r = 3, if two vertices in an edge are assigned the same colour, then the third vertex is assigned...

詳細記述

書誌詳細
主要な著者: Nakajima, T-V, Zivny, S
フォーマット: Conference item
言語:English
出版事項: Leibniz International Proceedings in Informatics, LIPIcs 2022

類似資料