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 the normal view instead:
scientific article; zbMATH DE number 4160136
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9420798420906068
0 references
0.89391028881073
0 references
0.8767409920692444
0 references
0.8583407998085022
0 references
0.8363286852836609
0 references
