A Semi-strong Perfect Digraph Theorem
Abstract
Reed 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.