Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure (Q6403600)
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 7845514
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure |
scientific article; zbMATH DE number 7845514 |
Statements
30 June 2022
0 references
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure (English)
0 references
0.9130455255508424
0 references
0.8751024007797241
0 references
0.8221354484558105
0 references
0.7661757469177246
0 references
0.7633516192436218
0 references
