Linear connectivity forces large complete bipartite minors: an alternative approach (Q651041)
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 connectivity forces large complete bipartite minors: an alternative approach |
scientific article; zbMATH DE number 5987726
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear connectivity forces large complete bipartite minors: an alternative approach |
scientific article; zbMATH DE number 5987726 |
Statements
Linear connectivity forces large complete bipartite minors: an alternative approach (English)
0 references
8 December 2011
0 references
graph minor
0 references
tree-width
0 references
tree-decomposition
0 references
path-decomposition
0 references
complete bipartite minor
0 references
grid minor
0 references
vortex structure
0 references
near embedding
0 references
graphs on surfaces
0 references
Euler's formula
0 references
0.8325881361961365
0 references
0.7759138941764832
0 references
0.764588475227356
0 references
0.7611802816390991
0 references
0.7607513070106506
0 references
