A family F of subsets of some set is intersecting when sets of F pairwise intersect. The family F is Helly when every intersecting subfamily of it contains a common element. In this paper we examine the families of vertex neighborhoods of a graph, with the aim of determining whether or not they are Helly, and also whether or nor they are hereditary Helly, that is, each of the induced subgraphs of the graph is Helly. We examine the cases where the neighborhoods are all open, or all closed, or mixed, that is, some open and some closed. For mixed neighborhoods there are two different kinds of choice of the neighborhood of each vertex to be considered: fixed or arbitrary choice. By fixed mixed neighborhood, we mean that the choice, open or clos...
A graph is clique-Helly when its cliques satisfy the Helly property. A graph is hereditary clique-He...
A graph is clique-Helly when its cliques satisfy the Helly property. A graph is hereditary clique-He...
AbstractIn this article we characterize bipartite graphs whose associated neighborhood hypergraphs h...
Graphs and AlgorithmsIn graph theory, the Helly property has been applied to families of sets, such ...
Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-05-12T14:03:31Z No. of bitstreams:...
AbstractLet p⩾1 and q⩾0 be integers. A family of sets F is (p,q)-intersecting when every subfamily F...
AbstractA graph is called neighborhood chordal if the neighborhood of every vertex is chordal. A fam...
AbstractA graph is called neighborhood chordal if the neighborhood of every vertex is chordal. A fam...
AbstractLet p⩾1 and q⩾0 be integers. A family of sets F is (p,q)-intersecting when every subfamily F...
AbstractA graph is clique-Helly if any family of mutually intersecting (maximal) cliques has non-emp...
A graph is clique-Helly if any family of mutually intersecting cliques has non-empty intersection. D...
Abstract. A graph is clique-Helly if any family of mutually intersecting (maximal) cliques has non-e...
AbstractThe notion of strong p-Helly hypergraphs was introduced by Golumbic and Jamison in 1985 [M.C...
Edge intersection graphs of paths on a grid (EPG graphs) aregraphs whose vertices can be represented...
In 1923, Eduard Helly published his celebrated theo-rem, which originated the well known Helly prope...
A graph is clique-Helly when its cliques satisfy the Helly property. A graph is hereditary clique-He...
A graph is clique-Helly when its cliques satisfy the Helly property. A graph is hereditary clique-He...
AbstractIn this article we characterize bipartite graphs whose associated neighborhood hypergraphs h...
Graphs and AlgorithmsIn graph theory, the Helly property has been applied to families of sets, such ...
Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-05-12T14:03:31Z No. of bitstreams:...
AbstractLet p⩾1 and q⩾0 be integers. A family of sets F is (p,q)-intersecting when every subfamily F...
AbstractA graph is called neighborhood chordal if the neighborhood of every vertex is chordal. A fam...
AbstractA graph is called neighborhood chordal if the neighborhood of every vertex is chordal. A fam...
AbstractLet p⩾1 and q⩾0 be integers. A family of sets F is (p,q)-intersecting when every subfamily F...
AbstractA graph is clique-Helly if any family of mutually intersecting (maximal) cliques has non-emp...
A graph is clique-Helly if any family of mutually intersecting cliques has non-empty intersection. D...
Abstract. A graph is clique-Helly if any family of mutually intersecting (maximal) cliques has non-e...
AbstractThe notion of strong p-Helly hypergraphs was introduced by Golumbic and Jamison in 1985 [M.C...
Edge intersection graphs of paths on a grid (EPG graphs) aregraphs whose vertices can be represented...
In 1923, Eduard Helly published his celebrated theo-rem, which originated the well known Helly prope...
A graph is clique-Helly when its cliques satisfy the Helly property. A graph is hereditary clique-He...
A graph is clique-Helly when its cliques satisfy the Helly property. A graph is hereditary clique-He...
AbstractIn this article we characterize bipartite graphs whose associated neighborhood hypergraphs h...