Sparse graphs with bounded induced cycle packing number have logarithmic treewidth (Q6500104)
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 7845510
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sparse graphs with bounded induced cycle packing number have logarithmic treewidth |
scientific article; zbMATH DE number 7845510 |
Statements
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth (English)
0 references
10 May 2024
0 references
treewidth
0 references
induced cycles
0 references
0 references
0 references
0 references
0.7673674821853638
0 references
0.7477319240570068
0 references
0.7473016381263733
0 references
0.7449954152107239
0 references
