论文信息 - A sufficient condition for an infinite digraph to be kernel-perfect - 字舞流文

A sufficient condition for an infinite digraph to be kernel-perfect

In this paper we show a sufficient condition for an infinite digraph to be kernelperfect, as a consequence we obtain several generalizations of well known results on the existence of kernels in finite and infinite digraphs.

Hortensia Galeana-Sánchez | Mucuy-kak Guevara | H. Galeana-Sánchez | M. Guevara

[1] Hortensia Galeana-Sánchez. Semikernels modulo F and kernels in digraphs , 2000, Discret. Math..

[2] Hortensia Galeana-Sánchez,et al. On kernels and semikernels of digraphs , 1984, Discret. Math..

[3] Pierre Duchet,et al. A sufficient condition for a digraph to be kernel-perfect , 1987, J. Graph Theory.

[4] E. Rowland. Theory of Games and Economic Behavior , 1946, Nature.

[5] Henry Meyniel,et al. A note on kernel-critical graphs , 1981, Discret. Math..

[6] Hortensia Galeana-Sánchez,et al. Some sufficient conditions for the existence of kernels in infinite digraphs , 2009, Discret. Math..

[7] P. Duchet,et al. Graphes Noyau-Parfaits , 1980 .

[8] Norbert Sauer,et al. On monochromatic paths in edge-coloured digraphs , 1982, J. Comb. Theory, Ser. B.

[9] M. Richardson. On weakly ordered systems , 1946 .