## A Characterization of Locally Semicomplete CKI-digraphs

- Hortensia Galeana-Sánchez, Mika Olsen
- Graphs and Combinatorics
- 2016

@article{GaleanaSnchez2013CharacterizationOA, title={Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3}, author={Hortensia Galeana-S{\'a}nchez and Mika Olsen}, journal={Discrete Mathematics}, year={2013}, volume={313}, pages={1464-1474} }

- Published 2013 in Discrete Mathematics
DOI:10.1016/j.disc.2013.03.008

A set N ⊆ V (D) is said to be a kernel if N is an independent set and for every vertex x ∈ (V (D) \ N) there is a vertex y ∈ N such that xy ∈ A(D). Let D be a digraph such that every proper induced subdigraph of D has a kernel. D is said to be kernel perfect digraph (KP-digraph) if the digraph D has a kernel and critical kernel imperfect digraph (CKI… CONTINUE READING

### Presentations referencing similar topics