Search
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.
Citations
-
5
CrossRef
-
0
Web of Science
-
4
Scopus
Authors (2)
Cite as
Full text
download paper
downloaded 36 times
- Publication version
- Accepted or Published Version
- DOI:
- Digital Object Identifier (open in new tab) 10.1016/j.dam.2016.06.009
- License
- Copyright (2016 Elsevier B.V.)
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
DISCRETE APPLIED MATHEMATICS
no. 217,
pages 48 - 52,
ISSN: 0166-218X - Language:
- English
- Publication year:
- 2016
- Bibliographic description:
- Obszarski P., Jastrzębski A.: Edge-coloring of 3-uniform hypergraphs// DISCRETE APPLIED MATHEMATICS. -Vol. 217, nr. 1 (2016), s.48-52
- DOI:
- Digital Object Identifier (open in new tab) 10.1016/j.dam.2016.06.009
- Verified by:
- Gdańsk University of Technology
seen 201 times