Tree-width and the monadic quantifier hi
β
J.A. Makowsky; J.P. MariΓ±o
π
Article
π
2003
π
Elsevier Science
π
English
β 269 KB
It is well known that on classes of graphs of bounded tree-width, every monadic second-order property is decidable in polynomial time. The converse is not true without further assumptions. It follows from the work of Robertson and Seymour, that if a class of graphs K has unbounded tree-width and is