Linear min-max relation between the treewidth of \(H\)-minor-free graphs and its largest grid (Q2904769)
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: Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid |
scientific article; zbMATH DE number 6070909
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear min-max relation between the treewidth of \(H\)-minor-free graphs and its largest grid |
scientific article; zbMATH DE number 6070909 |
Statements
23 August 2012
0 references
grid minor
0 references
treewidth
0 references
graph minor
0 references
min-max relation
0 references
Linear min-max relation between the treewidth of \(H\)-minor-free graphs and its largest grid (English)
0 references
0.9865812659263612
0 references
0.9825732111930848
0 references
0.8641232252120972
0 references
0.8612182140350342
0 references
0.8599846959114075
0 references
