Edge-coloring of 3-uniform hypergraphs
From MaRDI portal
Publication:729801
DOI10.1016/j.dam.2016.06.009zbMath1351.05087OpenAlexW2493458272MaRDI QIDQ729801
Andrzej Jastrzȩbski, Paweł Obszarski
Publication date: 22 December 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.06.009
Hypergraphs (05C65) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
The matroid intersection cover problem, Concepts on coloring of cluster hypergraphs with application
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic behavior of the chromatic index for hypergraphs
- An O(qn) algorithm to q-color a proper family of circular arcs
- An \(0(n^{1.5})\) algorithm to color proper circular arcs
- The NP-Completeness of Edge-Coloring
- The Complexity of Coloring Circular Arcs and Chords
- On the Complexity of Timetable and Multicommodity Flow Problems
- Graph Classes: A Survey
- NP completeness of the edge precoloring extension problem on bipartite graphs