Linearity is strictly more powerful than contiguity for encoding graphs (Q284761)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linearity is strictly more powerful than contiguity for encoding graphs |
scientific article; zbMATH DE number 6581801
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linearity is strictly more powerful than contiguity for encoding graphs |
scientific article; zbMATH DE number 6581801 |
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
