On the complexity of recognizing perfectly orderable graphs (Q918707)
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: On the complexity of recognizing perfectly orderable graphs |
scientific article; zbMATH DE number 4160136
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of recognizing perfectly orderable graphs |
scientific article; zbMATH DE number 4160136 |
Statements
On the complexity of recognizing perfectly orderable graphs (English)
0 references
1990
0 references
perfectly orderable graphs
0 references
