- Tytuł:
- KP-digraphs and CKI-digraphs satisfying the k-Meyniels condition
- Autorzy:
-
Galeana-Sánchez, H.
Neumann-Lara, V. - Powiązania:
- https://bibliotekanauki.pl/articles/972038.pdf
- Data publikacji:
- 1996
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
digraph
kernel
independent set of vertices
absorbing set of vertices
kernel-perfect digraph
critical-kernel-imperfect digraph
τ-system
τ₁-system
indepedent kernel modulo Q
co-rooted tree
τ-construction
τ₁-construction - Opis:
- A digraph D is said to satisfy the k-Meyniel’s condition if each odd directed cycle of D has at least k diagonals. The study of the k-Meyniel’s condition has been a source of many interesting problems, questions and results in the development of Kernel Theory. In this paper we present a method to construct a large variety of kernel-perfect (resp. critical kernel-imperfect) digraphs which satisfy the k-Meyniel’s condition.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 1996, 16, 1; 5-16
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł