On the complexity of recognizing perfectly orderable graphs (Q918707): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3347930 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3291037 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Characterization of Comparability Graphs and of Interval Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: \(P_ 4\)-comparability graphs / rank | |||
Normal rank | |||
Latest revision as of 09:23, 21 June 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
