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

DOI10.1007/3-540-61228-9_107zbMATH Open1412.68167OpenAlexW115396331MaRDI QIDQ4645296FDOQ4645296

Authors: Bruno Courcelle 

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

Recommendations

• The monadic second-order logic of graphs. X: Linear orderings
• Computer Science Logic
• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
• The monadic second-order logic of graphs XVI : Canonical graph decompositions
• Graph decompositions definable in monadic second-order logic

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

• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Monadic second-order definable graph transductions: a survey
• Title not available (Why is that?)
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
• 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
• Theory of 2-structures. II: Representation through labeled tree families
• Structural properties of context-free sets of graphs generated by vertex replacement
• Recognizable sets of graphs: equivalent definitions and closure properties
• Title not available (Why is that?)

Cited In (8)

• Graph decompositions definable in monadic second-order logic
• The monadic second-order logic of graphs XVI : Canonical graph decompositions
• The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs
• Monadic second-order definable graph orderings
• Title not available (Why is that?)
• Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second - Order Logic
• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
• Computer Science Logic

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645296)