Recognizable sets of graphs of bounded tree-width

DOI10.1007/3-540-57787-4_9zbMath1494.68107OpenAlexW1506348042MaRDI QIDQ5096279

Jens Lagergren

Publication date: 16 August 2022

Published in: Graph Transformations in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57787-4_9

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Cites Work

• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Easy problems for tree-decomposable graphs
• The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
• Recognizable sets of graphs: equivalent definitions and closure properties
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recognizable sets of graphs of bounded tree-width