Proves semistrong edge coloring decision problem is in P for k ≤ 2 and NP-complete for k ≥ 3, plus a polynomial-time algorithm for the exact index on trees.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Computational results on semistrong edge coloring of graphs
Proves semistrong edge coloring decision problem is in P for k ≤ 2 and NP-complete for k ≥ 3, plus a polynomial-time algorithm for the exact index on trees.