Given a simple undirected graph G and a positive integer s the Maximum Vertex Coverage
Problem is the problem of finding a set U of s vertices of G such that the number of edges …

In this paper, we show that the clique-transversal number τC (G) and the clique-
independence number αC (G) are equal for any distance-hereditary graph G. As a byproduct …

Abstract Let G=(V, E) be a graph. A clique-transversal set D is a subset of vertices of G such
that D meets all cliques of G, where a clique is defined as a complete subgraph maximal …

Berge defined a hypergraph to be balanced if its incidence matrix is balanced. We consider
this concept applied to graphs, and call a graph to be balanced when its clique matrix is …

This paper studies the maximum-clique independence problem and some variations of the
clique transversal problem such as the {k}-clique, maximum-clique, minus clique, signed …

A graph G is clique-perfect if the cardinality of a maximum cliqueindependent set of H is
equal to the cardinality of a minimum cliquetransversal of H, for every induced subgraph H of …

A biclique of a graph G is a maximal complete bipartite induced subgraph of G with at least
one edge. We define and study the time complexity of the problems of finding the minimum …

A graph is clique-perfect if the maximum number of pairwise disjoint maximal cliques equals
the minimum number of vertices intersecting all maximal cliques for each induced subgraph …

A clique-transversal of a graph G is a subset of vertices intersecting all the cliques of G. It is
NP-hard to determine the minimum cardinality τ c of a clique-transversal of G. In this work …

A minus clique-transversal function of a graph G=(V, E) is a function f: V→{-1, 0, 1} such
that∑ u∈ V (C) f (u)⩾ 1 for every clique C of G. The weight of a minus clique-transversal …