A semi-strong perfect digraph theorem. Issue 3 (1st September 2020)
- Record Type:
- Journal Article
- Title:
- A semi-strong perfect digraph theorem. Issue 3 (1st September 2020)
- Main Title:
- A semi-strong perfect digraph theorem
- Authors:
- Andres, Stephan Dominique
Bergold, Helena
Hochstättler, Winfried
Wiehe, Johanna - Abstract:
- Abstract: Reed (1987) showed that, if two graphs are P 4 -isomorphic, then either both are perfect or none of them is. In this note, we will derive an analogous result for perfect digraphs.
- Is Part Of:
- AKCE International Journal of Graphs and Combinatorics. Volume 17:Issue 3(2020)
- Journal:
- AKCE International Journal of Graphs and Combinatorics
- Issue:
- Volume 17:Issue 3(2020)
- Issue Display:
- Volume 17, Issue 3 (2020)
- Year:
- 2020
- Volume:
- 17
- Issue:
- 3
- Issue Sort Value:
- 2020-0017-0003-0000
- Page Start:
- 992
- Page End:
- 994
- Publication Date:
- 2020-09-01
- Subjects:
- Dichromatic number -- perfect graph -- perfect digraph
05C17 -- 05C20 -- 05C15 - DOI:
- 10.1016/j.akcej.2019.12.018 ↗
- Languages:
- English
- ISSNs:
- 0972-8600
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD Digital store
- Ingest File:
- 14866.xml