Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable (Q1196561): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02350628 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091248144 / rank | |||
Normal rank | |||
Latest revision as of 09:19, 30 July 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
