Kernels in some orientations of comparability graphs (Q1823257): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0095-8956(89)90070-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2095492932 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3941433 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the orientation of meyniel graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphes Noyau-Parfaits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On monochromatic paths in edge-coloured digraphs / rank | |||
Normal rank |
Latest revision as of 10:37, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Kernels in some orientations of comparability graphs |
scientific article |
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