A Semi-strong Perfect Digraph Theorem

Stephan Dominique Andres, Helena Bergold, Winfried Hochstättler +1

Reed showed that, if two graphs are $P_4$-isomorphic, then either both are perfect or none of them is. In this note we will derive an analogous result for perfect digraphs.