On the complexity of recognizing a class of perfectly orderable graphs (Q1917290)
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 a class of perfectly orderable graphs |
scientific article; zbMATH DE number 897394
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of recognizing a class of perfectly orderable graphs |
scientific article; zbMATH DE number 897394 |
Statements
On the complexity of recognizing a class of perfectly orderable graphs (English)
0 references
7 July 1996
0 references
perfectly orderable graphs
0 references
0.9942266
0 references
0.95550066
0 references
0 references
0.91785944
0 references
0.9171748
0 references
0 references
0.91434276
0 references
0.90489435
0 references
0 references
