| DC Field | Value | Language |
|---|
| dc.contributor.author | GALEANA SANCHEZ, HORTENCIA | - |
| dc.contributor.author | OLSEN, MIKA | - |
| dc.coverage.spatial | <dc:creator id="info:eu-repo/dai/mx/cvu/3205">HORTENCIA GALEANA SANCHEZ</dc:creator> | - |
| dc.coverage.spatial | <dc:creator id="info:eu-repo/dai/mx/cvu/201785">MIKA OLSEN</dc:creator> | - |
| dc.coverage.temporal | <dc:subject>info:eu-repo/classification/cti/7</dc:subject> | - |
| dc.date.accessioned | 2020-07-02T17:36:22Z | - |
| dc.date.available | 2020-07-02T17:36:22Z | - |
| dc.date.issued | 2013 | - |
| dc.identifier.citation | Discrete Mathematics, vol. 313, Issue 13, 6 July 2013 | en_US |
| dc.identifier.uri | http://ilitia.cua.uam.mx:8080/jspui/handle/123456789/561 | - |
| dc.description.abstract | A set is said to be a kernel if is an independent set and for every vertex there is a vertex such that . Let be a digraph such that every proper induced subdigraph of has a kernel. is said to be kernel perfect digraph (KP-digraph) if the digraph has a kernel and critical kernel imperfect digraph (CKI-digraph) if the digraph does not have a kernel. In this paper we characterize the asymmetric CKI-digraphs with covering number at most . Moreover, we prove that the only asymmetric CKI-digraphs with covering number at most are: , and . Several interesting consequences are obtained. | en_US |
| dc.description.sponsorship | Discrete Mathematics | en_US |
| dc.language.iso | Inglés | en_US |
| dc.publisher | Ámsterdam : Elsevier | en_US |
| dc.relation.haspart | 0012-365X | - |
| dc.rights | https://doi.org/10.1016/j.disc.2013.03.008 | - |
| dc.rights | https://www.sciencedirect.com/science/article/pii/S0012365X13001222 | - |
| dc.subject | Teoría de grafos | en_US |
| dc.subject | Matemáticas discretas | en_US |
| dc.title | Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3 | en_US |
| dc.type | Artículo | en_US |
| Aparece en las colecciones: | Artículos
|
