Covering the cliques of a graph with vertices

Abstract The folloeing problem is investigated. Given an undirected graph G , determine the smallest cardinality of a vertex set that meets all complete subgraphs K ⊂ G maximal under inclusion.

[1]  Zbigniew Lonc,et al.  Chains, antichains, and fibres , 1987, J. Comb. Theory, Ser. A.

[2]  Zsolt Tuza,et al.  Clique-transversal sets of line graphs and complements of line graphs , 1991, Discret. Math..

[3]  Zsolt Tuza,et al.  Improved lower bounds on k-independence , 1991, J. Graph Theory.

[4]  Zsolt Tuza,et al.  Covering all cliques of a graph , 1991, Discret. Math..

[5]  R. L. Brooks.  On Colouring the Nodes of a Network , 1941 .

[6]  János Komlós,et al.  A Note on Ramsey Numbers , 1980, J. Comb. Theory, Ser. A.

[7]  P. Erdös,et al.  Graph Theory and Probability , 1959 .