arXiv (All)
open access
W[1]-Hardness of Upper Clique Transversal
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 $k$ is W[1]-hard when parameterized by $k$.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Upper Clique Transversal Problem: Hardness and Algorithms#1297967
- Clique Number of Tournaments II#984399
- Subquadratic-Query Algorithms for Finding Another Maximum Matroid Intersection#1011893
- Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound#200590
- On the local average order of dominating sets#1248726
Record · ID 1200568
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive