A Semi-strong Perfect Digraph Theorem
classification
🧮 math.CO
keywords
perfectanalogousderivedigraphdigraphseithergraphsisomorphic
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.