A minimum clique-transversal set MCT (G) of a graph G=(V, E) is a set S⊆ V of minimum
cardinality that meets all maximal cliques in G. A maximum clique-independent set MCI (G) …

A clique transversal in a graph is a set of vertices intersecting all maximal cliques. The
problem of determining the minimum size of a clique transversal has received considerable …

A maximal geodesic in a graph is a geodesic (alias shortest path) which is not a subpath of a
longer geodesic. The geodesic-transversal problem in a graph G is introduced as the task to …

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 …

We present a fixed-parameter algorithm that constructively solves the k-dominating set
problem on any class of graphs excluding a single-crossing graph (a graph that can be …

Perfect graphs form a well-known class of graphs introduced by Berge in the 1960s in terms
of a min–max type equality involving two famous graph parameters. In this work, we survey …

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 …

Abstract The Connected Vertex Cover problem is to decide if a graph G has a vertex cover of
size at most k that induces a connected subgraph of G. This is a well-studied problem …

A clique-transversal of a graph G is a subset of vertices intersecting all the cliques of G. A
clique-independent set is a subset of pairwise disjoint cliques of G. Denote by τ C (G) and α …

A maximum clique transversal set in a graph G is a set S of vertices such that every
maximum clique of G contains at least a vertex in S. Clearly, removing a maximum clique …