The definition in monadic second-order logic of modular decompositions of ordered graphs

DOI10.1007/3-540-61228-9_107zbMath1412.68167OpenAlexW115396331MaRDI QIDQ4645296

No author found.

Publication date: 10 January 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61228-9_107

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Automata and formal grammars in connection with logical questions (03D05)

Cites Work

• Unnamed Item
• Unnamed Item
• Theory of 2-structures. II: Representation through labeled tree families
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
• Monadic second-order definable graph transductions: a survey
• The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
• The monadic second-order logic of graphs. VIII: Orientations
• Structural properties of context-free sets of graphs generated by vertex replacement
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Recognizable sets of graphs: equivalent definitions and closure properties

This page was built for publication: The definition in monadic second-order logic of modular decompositions of ordered graphs