<p>I want to ask if strong coloring of a k-uniform hypergraph using only k colors is NP-Hard or NP-Complete? If you can add a reference this will be helpful. </p>

CC BY-SA 4.0
2020-02-26T07:17:33.053Z
Please don't cross-post, this question is perfectly fine for CS.SE.
Juho
CC BY-SA 4.0
2020-02-26T08:49:23.033Z
Cross-posted: https://cs.stackexchange.com/q/121160/755, https://cstheory.stackexchange.com/q/46397/5038.  Please [do not post the same question on multiple sites](https://meta.stackexchange.com/q/64068).
D.W.
<graph-colouring><hypergraphs>
K-Uniform Hypergraph Strong Coloring
Salwa
# K-Uniform Hypergraph Strong Coloring

(Asked by: username_0 on 2020-02-26)

I want to ask if strong coloring of a k-uniform hypergraph using only k colors is NP-Hard or NP-Complete? If you can add a reference this will be helpful.

**Tags:** graph-colouring, hypergraphs

> **Comments:**
> **username_1**: Please don't cross-post, this question is perfectly fine for CS.SE.  
> **username_2**: Cross-posted: https://cs.stackexchange.com/q/121160/755, https://cstheory.stackexchange.com/q/46397/5038.  Please [do not post the same question on multiple sites](https://meta.stackexchange.com/q/64068).  

---

## 0 answers

