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.
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-09-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2019.12.018 |