On the hereditary (p,q)-Helly property of hypergraphs, cliques, and bicliques
From MaRDI portal
Publication:324846
recognition algorithms\((p,q)\)-Helly propertyforbidden induced subgraphsforbidden partial subhypergraphsmaximal bicliquesmaximal cliques
Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Hypergraphs (05C65) Helly-type theorems and geometric transversal theory (52A35)
Recommendations
Cites work
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 786134 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- Characterization and recognition of generalized clique-Helly graphs
- Extremal bi-Helly families
- Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs
- On hereditary Helly classes of graphs
- On the strong \(p\)-Helly property
- The edge intersection graphs of paths in a tree
Cited in
(8)- On the strong \(p\)-Helly property
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
- On the generalized Helly property of hypergraphs, cliques, and bicliques
- scientific article; zbMATH DE number 2096437 (Why is no real title available?)
- Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration
- Graph-Theoretic Concepts in Computer Science
- On hereditary Helly classes of graphs
This page was built for publication: On the hereditary \((p,q)\)-Helly property of hypergraphs, cliques, and bicliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324846)