A Monadic Second-Order Definition of the Structure of Convex Hypergraphs

  • Bruno Courcelle LaBRI
  • Published 1999
We consider hypergraphs with unordered hyperedges of unbounded rank. Each hypergraph has a unique modular decomposition, which is a tree, the nodes of which consist of certain prime subhypergraphs of the considered hypergraph. One can define this decomposition by Monadic Second-order (MS) logical formulas. Such a hypergraph is convex if the vertices are… CONTINUE READING