A semi-strong perfect digraph theorem
A semi-strong perfect digraph theorem
Reed (1987) showed that, if two graphs are P4-isomorphic, then either both are perfect or none of them is. In this note, we will derive an analogous result for perfect digraphs.