Linearity is strictly more powerful than contiguity for encoding graphs (Q284761)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linearity is strictly more powerful than contiguity for encoding graphs |
scientific article |
Statements
Linearity is strictly more powerful than contiguity for encoding graphs (English)
0 references
18 May 2016
0 references
graph encoding
0 references
linearity
0 references
contiguity
0 references
cographs
0 references
0 references
0 references
