Edge-treewidth: algorithmic and combinatorial properties (Q6069149)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7764544
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge-treewidth: algorithmic and combinatorial properties |
scientific article; zbMATH DE number 7764544 |
Statements
Edge-treewidth: algorithmic and combinatorial properties (English)
0 references
13 November 2023
0 references
graph parameters
0 references
edge-treewidth
0 references
treewidth
0 references
obstructions
0 references
weak topological minors
0 references
0.7434867024421692
0 references
0.7346771359443665
0 references
0.7336044311523438
0 references
0.7306877970695496
0 references
0.7282134890556335
0 references
