In this article we characterize bipartite graphs whose associated neighborhood hypergraphs have the Helly property. We examine incidence graphs both hypergraphs and linear hypergraphs and we give a polynomial algorithm to recognize if a linear hypergraph has the Helly property. © 2001 Published by Elsevier Science B.V.
Bretto, A., Cherifi, H., & Ubéda, S. (2001). An efficient algorithm for Helly property recognition in a linear hypergraph. In Electronic Notes in Theoretical Computer Science (Vol. 46, pp. 177–187). Elsevier. https://doi.org/10.1016/S1571-0661(04)80985-X