Decomposability of abstract and path-induced convexities in hypergraphs

DOI10.7151/dmgt.1815zbMath1317.05134OpenAlexW1963590958MaRDI QIDQ2516676

Marina Moscarini, Francesco Mario Malvestuto

Publication date: 4 August 2015

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1815

zbMATH Keywords

convex hullconvex geometryhypergraph convexitypath-induced convexity

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Hypergraphs (05C65) Axiomatic and generalized convexity (52A01)

Related Items

A new notion of convexity in digraphs with an application to Bayesian networks

Cites Work

• Equivalence between hypergraph convexities
• Canonical and monophonic convexities in hypergraphs
• Decomposition by clique separators
• Convex sets in graphs. II: Minimal path convexity
• An algorithm for finding clique cut-sets
• On triangle path convexity in graphs
• Convexities related to path properties on graphs
• Decomposable convexities in graphs and hypergraphs
• Optimal decomposition by clique separators
• On the Desirability of Acyclic Database Schemes
• Convexity in Graphs and Hypergraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item