On domination perfect graphs

Publication date 10 February 2018

Abstract: Let

g a m m a (G)

and

denote the domination number and the covering number of a graph

G

, respectively. A connected non-trivial graph

G

is said to be

-{perfect} if

for every non-trivial induced connected subgraph

H

of

G

. In this note we present an elementary proof of a characterization of the

-perfect graphs.

This page was built for publication: On domination perfect graphs