W[1]-Hardness of Upper Clique Transversal
arXiv:2610.04917
Abstract
A clique transversal of a graph is a set of vertices intersecting every maximal clique. We prove that deciding whether a graph has an inclusion-wise minimal clique transversal of size at least is W[1]-hard when parameterized by .
10 pages, 4 figures