Complexity aspects of generalized Helly hypergraphs

DOI10.1016/j.ipl.2006.02.007zbMath1184.05086OpenAlexW1996303391MaRDI QIDQ845662

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

Publication date: 29 January 2010

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

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

zbMATH Keywords

computational complexitycombinatorial problemsHelly propertyHelly hypergraphsintersecting sets

Mathematics Subject Classification ID

Hypergraphs (05C65) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (5)

The Helly property on subfamilies of limited size ⋮ The colorful Helly theorem and general hypergraphs ⋮ On the generalized Helly property of hypergraphs, cliques, and bicliques ⋮ On the strong \(p\)-Helly property ⋮ The Colorful Helly Property for Hypergraphs

Cites Work

• The edge intersection graphs of paths in a tree
• The Helly property on subfamilies of limited size
• On domination problems for permutation and other graphs
• Induced matchings
• Extremal bi-Helly families
• Graph Classes: A Survey
• Line Graphs of Helly Hypergraphs
• An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph
• Graph-Theoretic Concepts in Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity aspects of generalized Helly hypergraphs