On the complexity of recognizing perfectly orderable graphs (Q918707): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:15, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of recognizing perfectly orderable graphs |
scientific article |
Statements
On the complexity of recognizing perfectly orderable graphs (English)
0 references
1990
0 references
perfectly orderable graphs
0 references
