Distance-hereditary graphs are clique-perfect

In this paper, we show that the clique-transversal number @t"C(G) and the clique-independence number @a"C(G) are equal for any distance-hereditary graph G. As a byproduct of proving that @t"C(G)=@a"C(G), we give a linear-time algorithm to find a minimum clique-transversal set and a maximum clique-independent set simultaneously for distance-hereditary graphs.