Searching for "Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Recognizability equals Monadic Second-Order definability, for sets of graphs of bounded tree-width.
by Denis Lapoire — 1998 — In Proc. STACS'98, volume 1373 of LNCS
…Recognizability equals Monadic Second-Order definability, for sets of graphs of bounded tree-width…
Cited by 8 (1 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB