A spectral lower bound for the treewidth of a graph and its consequences (Q1014419)
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 5547799
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A spectral lower bound for the treewidth of a graph and its consequences |
scientific article; zbMATH DE number 5547799 |
Statements
A spectral lower bound for the treewidth of a graph and its consequences (English)
0 references
28 April 2009
0 references
combinatorial problems
0 references
eigenvalue
0 references
Laplacian matrix
0 references
treewidth
0 references
hypercube
0 references
chordless cycle
0 references
graph minor
0 references
0 references
0.7687196135520935
0 references
0.7423902153968811
0 references
0.7366664409637451
0 references
0.7338581085205078
0 references
0.7306492328643799
0 references
