A monadic second-order definition of the structure of convex hypergraphs.

DOI10.1006/inco.2002.3130zbMath1049.68098OpenAlexW2064733559MaRDI QIDQ1400707

No author found.

Publication date: 2002

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2002.3130

zbMATH Keywords

decidable monadic second-order theorybounded clique-width

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Decidability of theories and sets of sentences (03B25)

Related Items (3)

A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs ⋮ GETGRATS ⋮ The monadic second-order logic of graphs. XV: On a conjecture by D. Seese

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The structure of the models of decidable monadic theories of graphs
• Hypergraphes de chaînes d'aretes d'un arbre
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Monadic second-order definable graph transductions: a survey
• The monadic second-order logic of graphs. X: Linear orderings
• The monadic second-order logic of graphs. XII: Planar graphs and planar maps
• The monadic second-order logic of graphs. VIII: Orientations
• The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions.
• The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs
• Upper bounds to the clique width of graphs
• An Algorithm for the Modular Decomposition of Hypergraphs
• Handbook of Graph Grammars and Computing by Graph Transformation

This page was built for publication: A monadic second-order definition of the structure of convex hypergraphs.