Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable (Q1196561): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q427811 |
Changed an Item |
||
| Property / author | |||
| Property / author: Konrad Engel / rank | |||
Normal rank | |||
Revision as of 18:40, 14 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable |
scientific article |
Statements
Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable (English)
0 references
16 January 1993
0 references
perfectly orderable graphs
0 references
kernel \(M\)-solvable
0 references
acyclic orientation
0 references
perfect graphs
0 references
