… We define a new class of hypergraphs (partitive hypergraphs) which generalizes both, the
… of an hypergraph. We give a characterization of the partitive hypergraphs and moreover of …

… such as (weakly) partitive and orthogonal families – … hypergraph modules and prove some
preliminary structural results. In Section 3 we propose a general algorithmic tool for partitive …

… of hypergraphs. In the … partitive and orthogonal families, we directly derive a linear time
algorithm for Courcelle’s decomposition. Then we introduce a general algorithmic tool for partitive …

… We define a new class of hypergraphs (partitive hypergraphs) which generalizes both,
the set of all externally related subsets of a graph and the set of all committees of an …

… We will assume that in the partitive tree of a hypergraph, every internal node with two children
is labeled q-complete. Let P be a partition of the vertices of H. A system of representaties …

… of a graph is weakly partitive, namely it is closed under the intersection, union, and difference
of its overlapping members. Any symmetric crossing (resp. weakly partitive) family F⊆2 X …

… Similarly as for arbitrary hypergraphs we can show. that the nonempty modules of a
hypergraph of fixed dimension form a partitive family, from which we can derive its tree …

… Extending these we find symmetric crossing and weakly partitive families: symmetric crossing
families are closed under the complementation of any member and under the intersection …

… a partitive family. In Subsection 3.1, we show that the set of the modules of a hypergraph
induces … To begin, we show that the set of the modules of a hypergraph is a partitive family (see …

… One of the most known point-partitive hypergraph is the family of modules of a graph. Here
a graph G = (V,E) is finite, loopless, and … Clearly we construct a point-partitive hypergraph: …