Helly type theorem and graphs

MaRDI QIDQ2707489zbMATH OpenFDO

Authors Alain Bretto, Bernard Laget

Publication date 27 August 2001

zbMATH Keywords

characterizationHelly propertyhypergraphintersecting hypergraphneighbourhood hypergraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Structural characterization of families of graphs (05C75)

Recommendations

• On neighborhood-Helly graphs
• scientific article; zbMATH DE number 5064049
• On Helly hypergraphs with variable intersection sizes.
• scientific article; zbMATH DE number 1002178
• Intersection graphs of Helly families of subtrees

Cited in

(12)

• On the clique behavior and Hellyness of the complements of regular graphs
• scientific article; zbMATH DE number 3884212 (Why is no real title available?)
• An efficient algorithm for Helly property recognition in a linear hypergraph
• Optimal guard sets and the Helly property
• scientific article; zbMATH DE number 1409130 (Why is no real title available?)
• A Radon theorem for Helly graphs
• On neighborhood-Helly graphs
• Convexity and fixed-point properties in Helly graphs
• On the Helly property working as a compactness criterion on graphs
• Helly-type theorems for the ordering of the vertices of a hypergraph
• A polynomial algorithm for the strong Helly property
• Helly's property for n-cliques and the degree of a graph

This page was built for publication: Helly type theorem and graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2707489)