Distance-hereditary graphs are clique-perfect Original Research Article

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