We review a characterization of domination perfect graphs in terms
of forbidden induced subgraphs obtained by Zverovich and Zverovich
\cite{ZverovichZ95} using a computer code.
Then we apply it to a problem of unique domination in graphs
recently proposed by Fischermann and Volkmann.