### 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.

Original language | English |
---|---|

Pages (from-to) | 279-289 |

Number of pages | 11 |

Journal | Discrete Mathematics |

Volume | 108 |

Issue number | 1-3 |

DOIs | |

Publication status | Published - Oct 28 1992 |

### Fingerprint

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Theoretical Computer Science

### Cite this

*Discrete Mathematics*,

*108*(1-3), 279-289. https://doi.org/10.1016/0012-365X(92)90681-5

**Covering the cliques of a graph with vertices.** / Erdős, P.; Gallai, Tibor; Tuza, Z.

Research output: Contribution to journal › Article

*Discrete Mathematics*, vol. 108, no. 1-3, pp. 279-289. https://doi.org/10.1016/0012-365X(92)90681-5

}

TY - JOUR

T1 - Covering the cliques of a graph with vertices

AU - Erdős, P.

AU - Gallai, Tibor

AU - Tuza, Z.

PY - 1992/10/28

Y1 - 1992/10/28

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=38249010168&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38249010168&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(92)90681-5

DO - 10.1016/0012-365X(92)90681-5

M3 - Article

AN - SCOPUS:38249010168

VL - 108

SP - 279

EP - 289

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -