Name
Abstract | ||
|---|---|---|
The Bandwidth Theorem of Böttcher, et al. [Mathematische Annalen 343 2009, 175-205] gives minimum degree conditions for the containment of spanning graphs H with small bandwidth and bounded maximum degree. We generalise this result to a-arrangeable graphs H with ΔH﾿n/logn, where n is the number of vertices of H. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1002/rsa.20593 | Random Structures & Algorithms |
Keywords | Field | DocType |
graph embedding | Sublinear function,Discrete mathematics,Combinatorics,Indifference graph,Vertex (geometry),Graph embedding,Chordal graph,Bandwidth (signal processing),Degree (graph theory),Mathematics,Bounded function | Journal |
Volume | Issue | ISSN |
48 | 2 | 1042-9832 |
Citations | PageRank | References |
0 | 0.34 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Julia Böttcher | 1 | 93 | 17.35 |
| Anusch Taraz | 2 | 168 | 37.71 |
| Andreas Würfl | 3 | 25 | 3.23 |