| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4949857 | Discrete Applied Mathematics | 2017 | 5 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
PaweŠObszarski, Andrzej Jastrzȩbski,