A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
The expressiveness of existential monadic second-order logic is investigated over several classes of nite graphs among them the graphs of bounded tree-width. A hierarchical approach to the decomposition of graphs is introduced which is related to the notion of tree decomposition. Among other results we show that existential monadic second-order logic on graphs of bounded tree-width is not closed under complement.doi:10.1007/bfb0028029 fatcat:5trrqacoengfda7andndm6mk7u