Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality

Erik D. Demaine and MohammadTaghi Hajiaghayi
Proc. 16th Symp. Discrete Algorithms, ACM and SIAM, Jan 2005, pp. 682–689

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!