Radchenko and Villegas characterized the chordal graphs by the inverse of their independence polynomials being Horn hypergeometric series in Radchenko et al. in 2021. In this paper, we reprove their result using some elementary combinatorial methods. Our proof is different from their proof, and it is based on the connection between the inverse of the multi-variate independence polynomials and the multi-colored chromatic polynomials of graphs, established by Arunkumar et al. in 2018.