Extending kernel perfect digraphs to kernel perfect critical digraphs

@article{GaleanaSnchez1991ExtendingKP,
  title={Extending kernel perfect digraphs to kernel perfect critical digraphs},
  author={Hortensia Galeana-S{\'a}nchez and Victor Neumann-Lara},
  journal={Discrete Mathematics},
  year={1991},
  volume={94},
  pages={181-187}
}
Galeana-SBnchez, H. and V. Neumann-Lara, Extending kernel perfect digraphs to kernel perfect critical digraphs, Discrete Mathematics 94 (1991) 181-187. In this paper we prove that any R-digraph is an induced subdigraph of an infinite set of R-digraphs. The method employed in the proof can be used as a powerful tool in the construction of a large class of R--digraphs. 
BETA

Similar Papers

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES

A note on kernel-critical graphs

  • Discrete Mathematics
  • 1981
VIEW 2 EXCERPTS

Erdo”s, Problems and results in Number Theory and Graph

P. Sj
  • Theory, in Proc. 9th Manitoba Conf. on Numerical Mathematics and Computing
  • 1979

Representation; noyaux en theorie des graphes et hypergrapbes

P. Duchet
  • 1979

Extension Theorems for Solutions of Irreflexive Relations.

  • Proceedings of the National Academy of Sciences of the United States of America
  • 1953