The Helly property on subfamilies of limited size

DOI10.1016/j.ipl.2004.10.004zbMath1173.68530OpenAlexW2080213234MaRDI QIDQ834991

Mitre C. Dourado, Fábio Protti, Jayme Luiz Szwarcfiter

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.10.004

zbMATH Keywords

computational complexityHelly propertyclique-Helly graphs

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Complexity aspects of generalized Helly hypergraphs ⋮ G-Graphs and Algebraic Hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity aspects of generalized Helly hypergraphs
• Cliques and extended triangles. A necessary condition for planar clique graphs
• A polynomial algorithm for the strong Helly property
• A characterization of clique graphs
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: The Helly property on subfamilies of limited size