Title of article
Distance-hereditary graphs are clique-perfect Original Research Article
Author/Authors
Chuan-Min Lee، نويسنده , , Maw-Shang Chang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
12
From page
525
To page
536
Abstract
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.
Keywords
Graphs , Clique-independence number , Clique-transversal number , Distance-hereditary graphs
Journal title
Discrete Applied Mathematics
Serial Year
2006
Journal title
Discrete Applied Mathematics
Record number
886216
Link To Document