AKCE International Journal of Graphs and Combinatorics (Sep 2020)

A semi-strong perfect digraph theorem

  • Stephan Dominique Andres,
  • Helena Bergold,
  • Winfried Hochstättler,
  • Johanna Wiehe

DOI
https://doi.org/10.1016/j.akcej.2019.12.018
Journal volume & issue
Vol. 17, no. 3
pp. 992 – 994

Abstract

Read online

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.

Keywords