1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.CC2026
W[1]-Hardness of Upper Clique Transversal
J. Pascal Gollin, Pascal J. Gollin, Tesshu Hanaka +3
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 s…
math.CO2024★ 1 cited
Conformality of Minimal Transversals of Maximal Cliques
Endre Boros, Vladimir Gurvich, Martin Milanič +2
Given a hypergraph , the dual hypergraph of is the hypergraph of all minimal transversals of . A hypergraph is conformal if it is the family of maximal cliques of a graph…
math.CO2023
Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
Endre Boros, Vladimir Gurvich, Martin Milanič +1
Given a hypergraph , the dual hypergraph of is the hypergraph of all minimal transversals of . The dual hypergraph is always Sperner, that i…