Abstract
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 transversal set reduces the clique number of a graph. We study algorithmic aspects of the problem, given a graph, to find a maximum clique transversal set of minimum cardinality. We consider the problem for planar graphs and present fixed parameter and approximation results. We also examine some other graph classes: Subclasses of chordal graphs such as k-trees, strongly chordal graphs, etc., graphs with few P4s, comparability graphs, and distance hereditary graphs.
Cite
CITATION STYLE
Chang, M. S., Kloks, T., & Lee, C. M. (2001). Maximum clique transversals. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2204, pp. 32–43). Springer Verlag. https://doi.org/10.1007/3-540-45477-2_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
