Skip to main content

Research Repository

Advanced Search

A semi-induced subgraph characterization of upper domination perfect graphs (1999)
Journal Article
Zverovich, V. E., Zverovich, I. E., Zverovich, I., & Zverovich, V. (1999). A semi-induced subgraph characterization of upper domination perfect graphs. Journal of Graph Theory, 31(1), 29-49. https://doi.org/10.1002/%28SICI%291097-0118%28199905%2931%3A1%3C29%3A%3AAID-JGT4%3E3.0.CO%3B2-G

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.