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
|
類似資料
-
Linearly ordered colourings of hypergraphs
著者:: Nakajima, T-V, 等
出版事項: (2022) -
A logarithmic approximation of linearly-ordered colourings
著者:: Håstad, J, 等
出版事項: (2024) -
On rainbow-free colourings of uniform hypergraphs
著者:: Groot Koerkamp, R, 等
出版事項: (2021) -
Defective colouring of hypergraphs
著者:: Girão, A, 等
出版事項: (2023) -
Inapproximability of counting hypergraph colourings
著者:: Galanis, A, 等
出版事項: (2022)