Computer Science Logic

DOI10.1007/11538363MaRDI QIDQ5394586zbMATH OpenOpenAlexFDO

Authors Christian Delhommé, Bruno Courcelle

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11538363

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
• The definition in monadic second-order logic of modular decompositions of ordered graphs
• 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
• The structure of the models of decidable monadic theories of graphs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
• Graph equivalences and decompositions definable in monadic second-order logic. The case of circle graphs
• The monadic second-order logic of graphs, II: Infinite graphs of bounded width

Cited in

(5)

• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
• Counting spanning trees in graphs using modular decomposition
• Graph decompositions definable in monadic second-order logic
• The definition in monadic second-order logic of modular decompositions of ordered graphs
• The monadic second-order logic of graphs XVI : Canonical graph decompositions

This page was built for publication: Computer Science Logic

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