A semi-induced subgraph characterization of upper domination perfect graphs
(1999)
Journal Article
Let β(G) and Γ(G) be the independence number and the upper domination number of a graph G, respectively. A graph G is called Γ-perfect if β(H) = Γ(H), for every induced subgraph H of G. The class of Γ-perfect graphs generalizes such well-known classe... Read More about A semi-induced subgraph characterization of upper domination perfect graphs.