<i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs (Q3476849): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3697033 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complement reducible graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Linear Recognition Algorithm for Cographs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a class of posets and the corresponding comparability graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a property of the class of n-colorable graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Dacey Graphs / rank | |||
Normal rank | |||
Revision as of 14:35, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | <i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs |
scientific article |
Statements
<i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs (English)
0 references
1989
0 references
cographs
0 references
tree representation
0 references
computational complexity
0 references
