Edge-coloring of 3-uniform hypergraphs
We consider edge-colorings of 3-uniform hypergraphs which is a natural generalization of the problem of edge-colorings of graphs. Various classes of hypergraphs are discussed and we make some initial steps to establish the border between polynomial and NP-complete cases. Unfortunately, the problem appears to be computationally difficult even for relatively simple classes of hypergraphs.
Paweł Obszarski, Andrzej Jastrzębski. (2016). Edge-coloring of 3-uniform hypergraphs, 217(1), 48-52. https://doi.org/10.1016/j.dam.2016.06.009
wyświetlono 27 razy