Abstract
In this paper we develop a general method to extend a kernel-perfect digraph to a critical kernel-imperfect digraph.
Similar content being viewed by others
References
Berge, Graphs. (North-Holland, Amsterdem 1985)
Galeana-Sánchez, H., Neumann-Lara, V.; On kernel-perfect critical digraphs. Discrete Math. 59, 257–265 (1986)
Galeana-Sánchez, H., Neumann-Lara, V.; Extending kernel-perfect digraphs to kernel-perfect critical digraphs. Submitted
Galeana-Sánchez, H., Neumann-Lara, V.; KP-digraphs and CKI-digraphs satisfying the K-Meyniel’s condition. Submitted
Galeana-Sánchez, H.; A new method to extend kernel-perfect digraphs to kernel-perfect critical digraphs. Discrete Math. 69, 207–209 (1988)
Jacob, H.; Etude Theorique du Noyau d’un graph. Thèse, Université Pierre et Marie Curie, Paris VII, 1979
Neumann-Lara, V.; Seminúcleos de una digráfica. Anales del Instituto de Matemáticas II, (1971), U.N.A.M.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Galeana-Sánchez, H., Neumann-Lara, V. New Extensions of Kernel Perfect Digraphs to Kernel Imperfect Critical Digraphs. Graphs and Combinatorics 10, 329–336 (1994). https://doi.org/10.1007/BF02986683
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02986683