Equivalent definitions of recognizability for sets of graphs of bounded tree-width

DOI10.1017/S096012950000092XzbMath0846.68054MaRDI QIDQ4882496

Jens Lagergren

Publication date: 12 September 1996

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

tree-widthfinite graphs

Mathematics Subject Classification ID

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

Related Items (8)

Computing Tree Decompositions ⋮ A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Recognizability, hypergraph operations, and logical types ⋮ Unnamed Item ⋮ On computing graph minor obstruction sets ⋮ Myhill-Nerode Methods for Hypergraphs

Cites Work

• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Easy problems for tree-decomposable graphs
• An algebraic theory of graph reduction
• Algebraic automata and context-free sets

This page was built for publication: Equivalent definitions of recognizability for sets of graphs of bounded tree-width