On the hereditary \((p,q)\)-Helly property of hypergraphs, cliques, and bicliques

DOI10.1016/J.ENDM.2015.07.060zbMath1347.05124OpenAlexW2207940932MaRDI QIDQ324846

Luciano N. Grippo, Martín D. Safe, Mitre C. Dourado

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.060

zbMATH Keywords

maximal cliquesforbidden induced subgraphsrecognition algorithms\((p,q)\)-Helly propertyforbidden partial subhypergraphsmaximal bicliques

Mathematics Subject Classification ID

Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Helly-type theorems and geometric transversal theory (52A35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

On the generalized Helly property of hypergraphs, cliques, and bicliques

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The edge intersection graphs of paths in a tree
• Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs
• Extremal bi-Helly families
• Characterization and recognition of generalized clique-Helly graphs
• On the strong \(p\)-Helly property

This page was built for publication: On the hereditary \((p,q)\)-Helly property of hypergraphs, cliques, and bicliques