Repozytorium publikacji - Politechnika Gdańska

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.

Autorzy

• dr Paweł Obszarski link otwiera się w nowej karcie ,
• mgr inż. Andrzej Jastrzębski link otwiera się w nowej karcie