The monadic second-order logic of graphs XVI : Canonical graph decompositions
From MaRDI portal
Publication:5310655
DOI10.2168/LMCS-2(2:2)2006zbMath1126.03016MaRDI QIDQ5310655
No author found.
Publication date: 11 October 2007
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Decidability of theories and sets of sentences (03B25)
Related Items (9)
Grammars and clique-width bounds from split decompositions ⋮ Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs ⋮ Counting minimal transversals of \(\beta\)-acyclic hypergraphs ⋮ Practical and efficient circle graph recognition ⋮ Practical and efficient split decomposition via graph-labelled trees ⋮ Circle graphs and monadic second-order logic ⋮ The modular decomposition of countable graphs. Definition and construction in monadic second-order logic ⋮ Recognizability, hypergraph operations, and logical types ⋮ On the treewidth of dynamic graphs
This page was built for publication: The monadic second-order logic of graphs XVI : Canonical graph decompositions
