Several papers appear to imply P=NP via chordal graphs, which suggests something is wrong.
As usual $\gamma(G)$ is the domination number and $i(G)$ and $\gamma^i(G)$ are the independence domination number.
According to VIZING’S CONJECTURE FOR CHORDAL GRAPHS, p.1
Theorem 1.1.  In chordal graphs $\gamma(G)=\gamma^i(G)=i(G)$.
According to graphclasses.org
In chordal graphs Domination is NP-complete and Independent Domination is polynomial.
The equality in Theorem 1.1 appears to imply P=NP since we can compute $\gamma(G)=i(G)$ in chordal graphs by the above result.
What is wrong with this?