The \(2\chi(G)\) conjecture for indicated colouring

Prove or disprove that every graph G satisfies \(\chi_i(G) \le 2\chi(G)\), thereby resolving the conjecture that the indicated chromatic number is at most twice the chromatic number.

Background

The paper recalls a conjecture from Grzesik asserting that the indicated chromatic number is at most twice the ordinary chromatic number for every graph. The paper constructs graphs with arbitrarily large chromatic number whose indicated chromatic number is asymptotically close to $3\chi(G)/2$, but these examples do not settle the conjectured factor of 2. The conjecture is explicitly identified as unresolved.