The monadic second-order logic of graphs : Definable sets of finite graphs

DOI10.1007/3-540-50728-0_34OpenAlexW1506761696MaRDI QIDQ6203539

Bruno Courcelle

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-50728-0_34

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42) Higher-order logic (03B16)

Related Items (2)

Confluence up to Garbage ⋮ Parameterized domination in circle graphs

Cites Work

• Graph minors. V. Excluding a planar graph
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Tree acceptors and some of their applications
• Über eine Eigenschaft der ebenen Komplexe
• The NP-completeness column: an ongoing guide
• Complexity of Finding Embeddings in a k-Tree
• Graph expressions and graph rewritings
• Algebraic automata and context-free sets
• The NP-completeness column: An ongoing guide
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The monadic second-order logic of graphs : Definable sets of finite graphs