Diameter and treewidth in minor-closed graph families

David Eppstein
Algorithmica 27:275–291, 2000
arXiv.org e-Print archive, math.CO/9907126
Mathematical Reviews 2001c:05132
http://dx.doi.org/10.1007/s004530010020

Cited by:

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