Efficiently distinguishing all tangles in locally finite graphs (Q6500103)
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: Efficiently distinguishing all tangles in locally finite graphs |
scientific article; zbMATH DE number 7845509
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficiently distinguishing all tangles in locally finite graphs |
scientific article; zbMATH DE number 7845509 |
Statements
Efficiently distinguishing all tangles in locally finite graphs (English)
0 references
10 May 2024
0 references
tangles
0 references
tree-decompositions
0 references
tree-of-tangles theorem
0 references
0.8436938524246216
0 references
0.7632099986076355
0 references
0.7599254846572876
0 references
0.7560263276100159
0 references
