论文信息 - Orientations of graphs in kernel theory

Orientations of graphs in kernel theory

Abstract In this paper we investigate structural properties of a certain class of graphs ( -free graphs) which are relevant in the study of kernel theory, -free graphs satisfy the strong perfect graph conjecture of Berge. We investigate orientations of -free graphs and other classes of graphs which produce kernel-perfect diagraphs.

Hortensia Galeana-Sánchez | Victor Neumann-Lara | V. Neumann-Lara | H. Galeana-Sánchez

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

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

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

[4] M. Richardson,et al. Solutions of Irreflexive Relations , 1953 .

[5] M. Richardson. Extension Theorems for Solutions of Irreflexive Relations. , 1953, Proceedings of the National Academy of Sciences of the United States of America.

[6] Hortensia Galeana-Sánchez,et al. A theorem about a conjecture of H. Meyniel on kernel-perfect graphs , 1986, Discret. Math..

[7] Hortensia Galeana-Sánchez,et al. Extending kernel perfect digraphs to kernel perfect critical digraphs , 1991, Discret. Math..

[8] Henry Meyniel,et al. Une generalisation du theoreme de Richardson sur l'existence de noyaux dans les graphes orientes , 1983, Discret. Math..

[9] J. Neumann,et al. Theory of games and economic behavior , 1945, 100 Years of Math Milestones.

[10] Hortensia Galeana-Sánchez,et al. A counterexample to a conjecture of meyniel on kernel-perfect graphs , 1982, Discret. Math..

[11] Derek G. Corneil,et al. Complement reducible graphs , 1981, Discret. Appl. Math..

[12] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.

[13] Hortensia Galeana-Sánchez,et al. On kernel-perfect critical digraphs , 1986, Discret. Math..