Theoretical Computer ScienceVolume 88, Issue 1, 30 September 1991, Pages 139-150A regular characterization of graph languages definable in monadic second-order logicAuthor links open overlay panelJoost EngelfrietShow moreShareCitehttps://doi.org/10.1016/0304-3975(91)90078-GGet rights and contentUnder an Elsevier user licenseopen archiveAbstractThe class of monadic second-order definable graph languages is the smallest class containing certain elementary graph languages, and closed under the boolean set operations and under projections. This holds for many restricted types of graphs.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1991 Published by Elsevier B.V.