Kernels in some orientations of comparability graphs (Q1823257): Difference between revisions

The following conjecture of H. Meyniel is dealt with: Let G be a perfect graph and let D be an orientation of G such that all 3-circuits of D have at least two reversible arcs. Then D has a kernel. The author has proved the conjecture for comparability graphs. The method of the proof is closely related to the method of \textit{B. Sands, N. Sauer} and \textit{R. Woodrow} [J. Comb. Theory, Ser. B 33, 271-275 (1982; Zbl 0488.05036)].