Partitive hypergraphs

DOI10.1016/0012-365X(81)90138-2zbMath0478.05071OpenAlexW2914415208MaRDI QIDQ1160636

M. C. Maurer, Michel Chein, Michel A. Habib

Publication date: 1981

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(81)90138-2

zbMATH Keywords

committeessubstitution decompositionexternally related subsets

Mathematics Subject Classification ID

Related Items (34)

A \(k\)-structure generalization of the theory of 2-structures ⋮ Two representations of finite ordered sets ⋮ An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures ⋮ Parameterized algorithms for the module motif problem ⋮ Unnamed Item ⋮ A matrix description of weakly bipartitive and bipartitive families ⋮ Resolutions of convex geometries ⋮ A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs ⋮ Spined categories: generalizing tree-width beyond graphs ⋮ Meta-kernelization with structural parameters ⋮ Tree-representation of set families and applications to combinatorial decompositions ⋮ Symmetric maximal Condorcet domains ⋮ Modules in Robinson Spaces ⋮ \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs ⋮ Algorithmic aspects of switch cographs ⋮ The facets of the polytope of modules of a graph. ⋮ A survey of the algorithmic aspects of modular decomposition ⋮ Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity ⋮ Computing \(H\)-joins with application to 2-modular decomposition ⋮ \(P_ 4\)-trees and substitution decomposition ⋮ Competitive graph searches ⋮ Linear-time modular decomposition of directed graphs ⋮ A Representation Theorem for Union-Difference Families and Application ⋮ Prime 3-uniform hypergraphs ⋮ Algorithmic aspects of a general modular decomposition theory ⋮ Efficient parallel algorithms for parameterized problems ⋮ A type of algebraic structure related to sets of intervals ⋮ Unifying the representation of symmetric crossing families and weakly partitive families ⋮ Modular decomposition and transitive orientation ⋮ 1-intersecting families ⋮ Graph decompositions definable in monadic second-order logic ⋮ Twin Vertices in Hypergraphs ⋮ Some results on more flexible versions of Graph Motif ⋮ 3-uniform hypergraphs: modular decomposition and realization by tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph derivatives
• Comparability graphs and a new matroid
• A decomposition property of basic acyclic graphs
• On certain polytopes associated with graphs
• Graphs indecomposable with respect to the X-join
• On the composition and decomposition of clutters
• A Combinatorial Decomposition Theory
• Graph substitution and set packing polytopes
• Transitiv orientierbare Graphen
• The group of an X-join of graphs
• Modules of Coherent Binary Systems
• Graph Structures
• Algèbre des relations de congruence

This page was built for publication: Partitive hypergraphs