A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
An Estimate of the Tree-Width of a Planar Graph Which Has Not a Given Planar Grid as a Minor
[chapter]
1998
Lecture Notes in Computer Science
We give a more simple than in [8] proof of the fact that if a finite graph has no minors isomorphic to the planar grid of the size of r × r, then the tree-width of this graph is less than exp(poly(r)). In the case of planar graphs we prove a linear upper bound which improves the quadratic estimate from [5] .
doi:10.1007/10692760_30
fatcat:2qcisq7r45dthlps4hxaicgiv4