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.
Authors
Additional information
- DOI
- Digital Object Identifier link open in new tab 10.1016/j.dam.2016.06.009
- Category
- Publikacja w czasopiśmie
- Type
- artykuł w czasopiśmie wyróżnionym w JCR
- Language
- angielski
- Publication year
- 2016
Source: MOSTWiedzy.pl - publication "Edge-coloring of 3-uniform hypergraphs" link open in new tab
