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...
| প্রধান লেখক: | , |
|---|---|
| বিন্যাস: | Conference item |
| ভাষা: | English |
| প্রকাশিত: |
Leibniz International Proceedings in Informatics, LIPIcs
2022
|