Abstract
A kernel of a digraphD is a set of vertices which is both independent and absorbant. In 1983, C. Berge and P. Duchet conjectured that an undirected graphG is perfect if and only if the following condition is fulfilled: ifD is an orientation ofG (where pairs of opposite arcs are allowed) and if every clique ofD has a kernel thenD has a kernel. We prove here the conjecture for the complements of strongly perfect graphs and establish that a minimal counterexample to the conjecture is not a complete join of an independent set with another graph.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. Berge, V. Chvátal (Eds.):Topics on Perfect Graphs, Ann. of Disc. Math. 21, 1984.
C. Berge, P. Duchet: Problème, Séminaire MSH, Paris, Janvier 1983.
C. Berge, P. Duchet: Solvability of perfect graphs., Proceedings of the Burnside-Raspail meeting, (Barbados 1986) McGill University, Montréal, 1987.
C. Berge, P. Duchet: Kernels and perfect graphs, Bull. Inst. Math. Acad. Sinica 164, 1988, 355–366.
M. Blidia: Contribution à l'étude des noyaux dans les graphes, Thesis, Univ. Paris 6, 1984.
M. Blidia: Kernels in parity graphs with an orientation condition, submitted.
M. Blidia: A parity digraph has a kernel,Combinatorica 6, (1986), 23–27.
M. Blidia, P. Duchet, F. Maffray: Meyniel graphs are kernel-M-solvable, submitted.
C. Champetier: Kernels in some orientations of comparability graphs,J. of Comb. Theory B 47 (1989), 111–113.
P. Duchet: Graphes noyaux-parfaits,Ann. Discr. Math. 9, (1980), 93–101.
P. Duchet: Parity graphs are kernel-M-solvable,J. Comb. Theory (B)43, (1980), 121–126.
H. Galeana-Sanchez, V. Neuman-Lara: On kernels and semi-kernels of digraphs,Disc. Math. 48, (1984), 67–76.
F. Maffray: Sur l'existence des noyaux dans les graphes parfaits, Thesis, Univ. Paris 6 1984.
F. Maffray On kernels ini-triangulated graphs,Disc. Math. 61, (1986), 247–251.