Highly Influenced

@article{Lucena2007AchievableSB, title={Achievable sets, brambles, and sparse treewidth obstructions}, author={Brian Lucena}, journal={Discrete Applied Mathematics}, year={2007}, volume={155}, pages={1055-1065} }

- Published 2007 in Discrete Applied Mathematics
DOI:10.1016/j.dam.2006.11.006

One consequence of the graph minor theorem is that for every k there exists a finite obstruction set Obs(T W k). However, relatively little is known about these sets, and very few general obstructions are known. The ones that are known are the cliques, and graphs which are formed by removing a few edges from a clique. This paper gives several general… CONTINUE READING

### Presentations referencing similar topics