Kernels in some orientations of comparability graphs (Q1823257)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Kernels in some orientations of comparability graphs |
scientific article; zbMATH DE number 4114668
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Kernels in some orientations of comparability graphs |
scientific article; zbMATH DE number 4114668 |
Statements
Kernels in some orientations of comparability graphs (English)
0 references
1989
0 references
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)].
0 references
directed graphs
0 references
perfect graph
0 references
kernel
0 references
0.9339248
0 references
0 references
0.9145821
0 references
0.9116198
0 references
0 references
