Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable (Q1196561)
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: Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable |
scientific article; zbMATH DE number 89193
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable |
scientific article; zbMATH DE number 89193 |
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
