Add to ORKGA graph is clique-Helly if any family of mutually intersecting cliques has non-empty intersection. Dourado, Protti and Szwarcfiter conjectured that every clique-Helly graph contains a vertex whose removal maintains it a clique-Helly graph. We will present a counterexample to this conjecture.Facultad de Ciencias Exacta
AbstractA graph G is clique-critical if G and G−x have different clique-graphs for all vertices x of...
AbstractThe notion of strong p-Helly hypergraphs was introduced by Golumbic and Jamison in 1985 [M.C...
AbstractA family C of sets has the Helly property if any subfamily C′ whose elements are pairwise in...
A graph is clique-Helly if any family of pairwise intersecting (maximal) cliques has non-empty total...
A graph is clique–Helly if every family of pairwise intersecting (maximal) cliques has non-empty tot...
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...
A graph G is convergent when there is some finite integer n 0, such that the n-th iterated clique g...
AbstractLet p⩾1 and q⩾0 be integers. A family of sets F is (p,q)-intersecting when every subfamily F...
AbstractIt is shown that for chordless path convexity in any graph, the Helly number equals the size...
A graph G is convergent when there is some finite integer n≥0, such that the n-th iterated clique gr...
Helly graphs are graphs in which every family of pairwise intersecting balls has a non-empty interse...
A family F of subsets of some set is intersecting when sets of F pairwise intersect. The family F is...
AbstractA graph is clique-Helly if any family of mutually intersecting (maximal) cliques has non-emp...
Abstract. A graph is clique-Helly if any family of mutually intersecting (maximal) cliques has non-e...
AbstractA graph G is clique-critical if G and G−x have different clique-graphs for all vertices x of...
AbstractThe notion of strong p-Helly hypergraphs was introduced by Golumbic and Jamison in 1985 [M.C...
AbstractA family C of sets has the Helly property if any subfamily C′ whose elements are pairwise in...
A graph is clique-Helly if any family of pairwise intersecting (maximal) cliques has non-empty total...
A graph is clique–Helly if every family of pairwise intersecting (maximal) cliques has non-empty tot...
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...
A graph G is convergent when there is some finite integer n 0, such that the n-th iterated clique g...
AbstractLet p⩾1 and q⩾0 be integers. A family of sets F is (p,q)-intersecting when every subfamily F...
AbstractIt is shown that for chordless path convexity in any graph, the Helly number equals the size...
A graph G is convergent when there is some finite integer n≥0, such that the n-th iterated clique gr...
Helly graphs are graphs in which every family of pairwise intersecting balls has a non-empty interse...
A family F of subsets of some set is intersecting when sets of F pairwise intersect. The family F is...
AbstractA graph is clique-Helly if any family of mutually intersecting (maximal) cliques has non-emp...
Abstract. A graph is clique-Helly if any family of mutually intersecting (maximal) cliques has non-e...
AbstractA graph G is clique-critical if G and G−x have different clique-graphs for all vertices x of...
AbstractThe notion of strong p-Helly hypergraphs was introduced by Golumbic and Jamison in 1985 [M.C...
AbstractA family C of sets has the Helly property if any subfamily C′ whose elements are pairwise in...