Fast approximation schemes for $K_{3,3}$-minor-free or $K_5$-minor-free graphs

MohammadTaghi Hajiaghayi, Naomi Nishimura, Prabhakar L. Ragde, and Dimitrios M. Thilikos
Electronic Notes in Discrete Mathematics 10, 2001
Proc. Euroconf. Combinatorics, Graph Theory, and Applications, Jaroslav Nešetril, ed., Univ. Autónoma de Barcelona, Centre de Recerca Matemŕtica, Sep 2001, pp. 158–163
http://plg.uwaterloo.ca/~plragde/papers/minorfree_COMB.ps
http://www.elsevier.com/gej-ng/31/29/24/49/27/63/endm10038.ps

Cites:

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