Skip to main content
Log in

New Extensions of Kernel Perfect Digraphs to Kernel Imperfect Critical Digraphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

In this paper we develop a general method to extend a kernel-perfect digraph to a critical kernel-imperfect digraph.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Berge, Graphs. (North-Holland, Amsterdem 1985)

  2. Galeana-Sánchez, H., Neumann-Lara, V.; On kernel-perfect critical digraphs. Discrete Math. 59, 257–265 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  3. Galeana-Sánchez, H., Neumann-Lara, V.; Extending kernel-perfect digraphs to kernel-perfect critical digraphs. Submitted

  4. Galeana-Sánchez, H., Neumann-Lara, V.; KP-digraphs and CKI-digraphs satisfying the K-Meyniel’s condition. Submitted

  5. Galeana-Sánchez, H.; A new method to extend kernel-perfect digraphs to kernel-perfect critical digraphs. Discrete Math. 69, 207–209 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  6. Jacob, H.; Etude Theorique du Noyau d’un graph. Thèse, Université Pierre et Marie Curie, Paris VII, 1979

    Google Scholar 

  7. Neumann-Lara, V.; Seminúcleos de una digráfica. Anales del Instituto de Matemáticas II, (1971), U.N.A.M.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02986683

Keywords

Navigation