Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs

European Journal of Combinatorics

Volumn 31, Issue 5, 2010, Pages 1217-1227

  Böttcher, Julia ^a   Pruessmann, Klaas P ^b   Taraz, Anusch ^a   Würfl, Andreas ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77951879563     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2009.10.010     Document Type: Article

References (21)

1. Alon N., and Capalbo M. Sparse universal graphs for bounded-degree graphs. Random Struct. Algorithms 31 2 (2007) 123-133
2. Alon N., Seymour P.D., and Thomas R. A separator theorem for non-planar graphs. J. Amer. Math. Soc. 3 (1990) 801-808
3. Bhatt S.N., Chung F., Leighton F.T., and Rosenberg A. Universal graphs for bounded-degree trees and planar graphs. SIAM J. Discrete Math. 2 (1989) 145-155
4. Bodlaender H.L. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209 1-2 (1998) 1-45
5. Böttcher J., Schacht M., and Taraz A. Proof of the bandwidth conjecture of Bollobás and Komlós. Math. Ann. 343 1 (2009) 175-205
6. Capalbo M. Small universal graphs for bounded-degree planar graphs. Combinatorica 22 3 (2002) 345-359
7. Carmi P., Dujmović V., Morin P., and Wood D.R. Distinct distances in graph drawings. Electron. J. Combin. 15 (2008) R107
8. Chung F. Labelings of graphs. Selected Topics in Graph Theory (1988), Academic Press, San Diego 151-168
9. Corradi K., and Hajnal A. On the maximal number of independent circuits in a graph. Acta Math. Acad. Sci. Hungar. 14 (1963) 423-439
10. Dirac G.A. Some theorems on abstract graphs. Proc. London Math. Soc. (3) 2 (1952) 69-81
11. Dujmović V., Suderman M., and Wood D.R. Graph drawings with few slopes. Comput. Geom. 38 3 (2007) 181-193
12. Gilbert J., Hutchinson J., and Tarjan R. A separator theorem for graphs of bounded genus. J. Algorithms 5 3 (1984) 391-407
13. M. Grohe, D. Marx, On tree width, bramble size, and expansion, J. Combin. Theory Ser. B (2008)
14. Hajnal A., and Szemerédi E. Proof of a conjecture of P. Erdo{double acute}s. Combinatorial theory and its applications, II (Proc. Colloq., Balatonfüred, 1969) (1970), North-Holland, Amsterdam 601-623
15. Hoory S., Linial N., and Widgerson A. Expander graphs and their applications. Bull. Am. Math. Soc. New Ser. 43 4 (2006) 439-561
16. Komlós J. The blow-up lemma. Recent trends in combinatorics (Mátraháza, 1995). Combin. Probab. Comput. 8 1-2 (1999) 161-176
17. Kühn D., and Osthus D. Embedding large subgraphs into dense graphs. In: Huczynka S., Mitchell J., and Roney-Dougal C. (Eds). Surveys in Combinatorics 2009 (2009), Cambridge University Press 137-167
18. Kühn D., Osthus D., and Taraz A. Large planar subgraphs in dense graphs. J. Combin. Theory Ser. B 95 2 (2005) 263-282
19. Lipton R., and Tarjan R. A separator theorem for planar graphs. SIAM J. Appl. Math. 36 (1979) 177-189
20. Robertson N., and Seymour P. Graph minors. V. Excluding a planar graph. J. Combin. Theory Ser. B 41 (1986) 115-138
21. Robertson N., and Seymour P. Graph minors. XX. Wagner's conjecture. J. Combin. Theory, Ser. B 92 2 (2004) 325-357