The concept of (k,l)-kernels of digraphs was introduced in [2]. Next, H. Galeana-Sanchez [4] proved a sufficient condition for a digraph to have a (k,l)-kernel. The result generalizes the well-known theorem of P. Duchet and it is formulated in terms of symmetric pairs of arcs. Our aim is to give necessary and sufficient conditions for digraphs without symmetric pairs of arcs to have a (k,l)-kernel. We restrict our attention to special superdigraphs of digraphs Pₘ and Cₘ.
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1135,
author = {Magdalena Kucharska and Maria Kwa\'snik},
title = {On (k,l)-kernels of special superdigraphs of Pm and Cm},
journal = {Discussiones Mathematicae Graph Theory},
volume = {21},
year = {2001},
pages = {95-109},
zbl = {1016.05035},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1135}
}
Magdalena Kucharska; Maria Kwaśnik. On (k,l)-kernels of special superdigraphs of Pₘ and Cₘ. Discussiones Mathematicae Graph Theory, Tome 21 (2001) pp. 95-109. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1135/
[000] [1] C. Berge, Graphs and Hypergraphs (North-Holland, Amsterdam, 1976).
[001] [2] M. Kwaśnik, The generalization of Richardson theorem, Discuss. Math. IV (1981) 11-14. | Zbl 0509.05048
[002] [3] V. Neumann-Lara, Seminúcleas en una digráfica, Anales del Instituto de Matemáticas de la Universidad Nacional Autónoma de México 11 (1971) 55-62.
[003] [4] H. Galeana-Sánchez, On the existence of (k,l)-kernels in digraphs, Discrete Math. 85 (1990) 99-102, doi: 10.1016/0012-365X(90)90167-G.
[004] [5] I. Włoch, Minimal Hamiltonian graphs having a strong (k,k-2)-kei>, Zeszyty Naukowe Politechniki Rzeszowskiej No. 127 (1994) 93-98. | Zbl 0853.05054