On the complexity of recognizing perfectly orderable graphs (Q918707): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 01:36, 5 March 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