Graph decompositions definable in monadic second-order logic
From MaRDI portal
Publication:3439302
DOI10.1016/j.endm.2005.06.003zbMath1137.03303OpenAlexW2024122625MaRDI QIDQ3439302
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.003
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitive hypergraphs
- A \(k\)-structure generalization of the theory of 2-structures
- A linear algorithm to decompose inheritance graphs into modules
- The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs
- A Combinatorial Decomposition Theory
- Decomposition of Directed Graphs
- Handbook of Graph Grammars and Computing by Graph Transformation
- Computer Science Logic
- Mathematical Foundations of Computer Science 2003
- Theory of Matroids
This page was built for publication: Graph decompositions definable in monadic second-order logic
