A Semi-strong Perfect Digraph Theorem
Combinatorics
2019-06-14 v1
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.
Keywords
Cite
@article{arxiv.1906.05650,
title = {A Semi-strong Perfect Digraph Theorem},
author = {Stephan Dominique Andres and Helena Bergold and Winfried Hochstättler and Johanna Wiehe},
journal= {arXiv preprint arXiv:1906.05650},
year = {2019}
}
Comments
5 pages, 1 figure