Complexity aspects of generalized Helly hypergraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5158487 (Why is no real title available?)
- scientific article; zbMATH DE number 3957109 (Why is no real title available?)
- scientific article; zbMATH DE number 3487492 (Why is no real title available?)
- scientific article; zbMATH DE number 3508549 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3641484 (Why is no real title available?)
- scientific article; zbMATH DE number 786134 (Why is no real title available?)
- scientific article; zbMATH DE number 863476 (Why is no real title available?)
- An efficient algorithm for Helly property recognition in a linear hypergraph
- Extremal bi-Helly families
- Graph Classes: A Survey
- Graph-Theoretic Concepts in Computer Science
- Induced matchings
- Line Graphs of Helly Hypergraphs
- On domination problems for permutation and other graphs
- The Helly property on subfamilies of limited size
- The edge intersection graphs of paths in a tree
Cited in
(9)- On the strong \(p\)-Helly property
- The Helly property on subfamilies of limited size
- The colorful Helly property for hypergraphs
- Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs
- On the generalized Helly property of hypergraphs, cliques, and bicliques
- Complexity aspects of the Helly property: graphs and hypergraphs
- Extremal bi-Helly families
- The colorful Helly theorem and general hypergraphs
- On Helly hypergraphs with variable intersection sizes.
This page was built for publication: Complexity aspects of generalized Helly hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845662)