A Semi-strong Perfect Digraph Theorem
arXiv:1906.05650
Abstract
Reed showed that, if two graphs are -isomorphic, then either both are perfect or none of them is. In this note we will derive an analogous result for perfect digraphs.
5 pages, 1 figure
arXiv:1906.05650
Reed showed that, if two graphs are -isomorphic, then either both are perfect or none of them is. In this note we will derive an analogous result for perfect digraphs.
5 pages, 1 figure