AbstractIn 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
We present a unifying procedure for recognizing intersection graphs of Helly families of paths in a ...
AbstractLet p⩾1 and q⩾0 be integers. A family of sets F is (p,q)-intersecting when every subfamily F...
AbstractThe definition of the Helly property for hypergraphs was motivated by the Helly theorem for ...
AbstractIn this article we characterize bipartite graphs whose associated neighborhood hypergraphs h...
A hypergraph is Helly if every family of hyperedges of it, formed by pairwise intersecting hyperedge...
AbstractThe notion of strong p-Helly hypergraphs was introduced by Golumbic and Jamison in 1985 [M.C...
Graphs and AlgorithmsIn graph theory, the Helly property has been applied to families of sets, such ...
AbstractThe definition of the Helly property for hypergraphs was motivated by the Helly theorem for ...
AbstractLet H be a hypergraph and t a natural number. The sets which can be written and the union of...
Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-05-12T14:03:31Z No. of bitstreams:...
A family F of subsets of some set is intersecting when sets of F pairwise intersect. The family F is...
In 1923, Eduard Helly published his celebrated theo-rem, which originated the well known Helly prope...
We present a unifying procedure for recognizing intersection graphs of Helly families of paths in a ...
We present a unifying procedure for recognizing intersection graphs of Helly families of paths in a ...
We present a unifying procedure for recognizing intersection graphs of Helly families of paths in a ...
We present a unifying procedure for recognizing intersection graphs of Helly families of paths in a ...
AbstractLet p⩾1 and q⩾0 be integers. A family of sets F is (p,q)-intersecting when every subfamily F...
AbstractThe definition of the Helly property for hypergraphs was motivated by the Helly theorem for ...
AbstractIn this article we characterize bipartite graphs whose associated neighborhood hypergraphs h...
A hypergraph is Helly if every family of hyperedges of it, formed by pairwise intersecting hyperedge...
AbstractThe notion of strong p-Helly hypergraphs was introduced by Golumbic and Jamison in 1985 [M.C...
Graphs and AlgorithmsIn graph theory, the Helly property has been applied to families of sets, such ...
AbstractThe definition of the Helly property for hypergraphs was motivated by the Helly theorem for ...
AbstractLet H be a hypergraph and t a natural number. The sets which can be written and the union of...
Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-05-12T14:03:31Z No. of bitstreams:...
A family F of subsets of some set is intersecting when sets of F pairwise intersect. The family F is...
In 1923, Eduard Helly published his celebrated theo-rem, which originated the well known Helly prope...
We present a unifying procedure for recognizing intersection graphs of Helly families of paths in a ...
We present a unifying procedure for recognizing intersection graphs of Helly families of paths in a ...
We present a unifying procedure for recognizing intersection graphs of Helly families of paths in a ...
We present a unifying procedure for recognizing intersection graphs of Helly families of paths in a ...
AbstractLet p⩾1 and q⩾0 be integers. A family of sets F is (p,q)-intersecting when every subfamily F...
AbstractThe definition of the Helly property for hypergraphs was motivated by the Helly theorem for ...
DOI
Add to ORKG