Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428)
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: Classes of graphs with low complexity: the case of classes with bounded linear rankwidth |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Classes of graphs with low complexity: the case of classes with bounded linear rankwidth |
scientific article |
Statements
Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (English)
0 references
8 February 2021
0 references
MSO-transductions of trees
0 references
MSO-transductions of paths
0 references
0 references
0 references
0.7986069917678833
0 references
0.7941399216651917
0 references
0.7682511806488037
0 references
0.7554749250411987
0 references
