Optimal guard sets and the Helly property

DOI10.1016/j.ejc.2010.08.001zbMath1213.05185OpenAlexW2093311917MaRDI QIDQ607361

Gábor Bacsó, Zsolt Tuza

Publication date: 22 November 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2010.08.001

zbMATH Keywords

Helly propertyclique hypergraphguard sets

Mathematics Subject Classification ID

Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Helly’s theorem: New variations and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Contractions and minimal k-colorability
• Normal hypergraphs and the perfect graph conjecture
• The cost chromatic number and hypergraph parameters
• The Representation of a Graph by Set Intersections