On the generalized Helly property of hypergraphs, cliques, and bicliques
From MaRDI portal
Publication:2689646
Recommendations
Cites work
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 22656 (Why is no real title available?)
- scientific article; zbMATH DE number 3508549 (Why is no real title available?)
- scientific article; zbMATH DE number 553916 (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?)
- scientific article; zbMATH DE number 1409177 (Why is no real title available?)
- A polynomial algorithm for the strong Helly property
- A simplified NP-complete satisfiability problem
- Arboricity and Subgraph Listing Algorithms
- Biclique-Helly graphs
- Characterization and recognition of generalized clique-Helly graphs
- Complexity aspects of generalized Helly hypergraphs
- Complexity aspects of the Helly property: graphs and hypergraphs
- Duality and perfection for edges in cliques
- Extremal bi-Helly families
- Faster recognition of clique-Helly and hereditary clique-Helly graphs
- Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs
- On Helly hypergraphs with variable intersection sizes.
- On hereditary Helly classes of graphs
- On the hereditary \((p,q)\)-Helly property of hypergraphs, cliques, and bicliques
- On the strong \(p\)-Helly property
- Reducibility among combinatorial problems
- The edge intersection graphs of paths in a tree
Cited in
(16)- Characterization and recognition of generalized clique-Helly graphs
- On the strong \(p\)-Helly property
- On the clique behavior and Hellyness of the complements of regular graphs
- The Helly property on subfamilies of limited size
- scientific article; zbMATH DE number 1409177 (Why is no real title available?)
- Complexity aspects of generalized Helly hypergraphs
- scientific article; zbMATH DE number 2096437 (Why is no real title available?)
- scientific article; zbMATH DE number 4091552 (Why is no real title available?)
- An efficient algorithm for Helly property recognition in a linear hypergraph
- On the hereditary \((p,q)\)-Helly property of hypergraphs, cliques, and bicliques
- Graph-Theoretic Concepts in Computer Science
- Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs
- On the generalized Helly property of hypergraphs, cliques, and bicliques
- On Helly hypergraphs with variable intersection sizes.
- Complexity aspects of the Helly property: graphs and hypergraphs
- Extremal bi-Helly families
This page was built for publication: On the generalized 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 Q2689646)