Recommendations
Cites work
- A generalization of Caratheodory's theorem
- Colourful Linear Programming and its Relatives
- Complexity aspects of generalized Helly hypergraphs
- Complexity aspects of the Helly property: graphs and hypergraphs
- scientific article; zbMATH DE number 3508549 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- Hypergraph imaging: An overview
- Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs
Cited in
(9)- Helly-type theorems for appropriate colorings of visibility sets
- Complexity aspects of the Helly property: graphs and hypergraphs
- Colored hypergraph isomorphism is fixed parameter tractable
- scientific article; zbMATH DE number 15373 (Why is no real title available?)
- The colorful Helly theorem and general hypergraphs
- scientific article; zbMATH DE number 6786475 (Why is no real title available?)
- Häggkvist-Hell graphs: A class of Kneser-colorable graphs
- The Helly property on subfamilies of limited size
- Complexity aspects of generalized Helly hypergraphs
This page was built for publication: The colorful Helly property for hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851534)