### Abstract

The following conjecture of T. Gallai is proved: If G is a chordal graph on n vertices, such that all its maximal complete subgraphs have order at least 3, then there is a vertex set of cardinality ≤n 3 which meets all maximal complete subgraphs of G. Further related results are given.

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

Pages (from-to) | 117-126 |

Number of pages | 10 |

Journal | Discrete Mathematics |

Volume | 86 |

Issue number | 1-3 |

DOIs | |

Publication status | Published - Dec 14 1990 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics

## Fingerprint Dive into the research topics of 'Covering all cliques of a graph'. Together they form a unique fingerprint.

## Cite this

Tuza, Z. (1990). Covering all cliques of a graph.

*Discrete Mathematics*,*86*(1-3), 117-126. https://doi.org/10.1016/0012-365X(90)90354-K