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.
2
-
$\begingroup$ Please don't cross-post, this question is perfectly fine for CS.SE. $\endgroup$– JuhoFeb 26, 2020 at 7:17
-
$\begingroup$ Cross-posted: cs.stackexchange.com/q/121160/755, cstheory.stackexchange.com/q/46397/5038. Please do not post the same question on multiple sites. $\endgroup$– D.W.Feb 26, 2020 at 8:49
Add a comment
|