Covering all cliques of a graph

Research output: Contribution to journalArticle

85 Citations (Scopus)

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 languageEnglish
Pages (from-to)117-126
Number of pages10
JournalDiscrete Mathematics
Volume86
Issue number1-3
DOIs
Publication statusPublished - Dec 14 1990

Fingerprint

Clique
Subgraph
Covering
Chordal Graphs
Graph in graph theory
Cardinality
Vertex of a graph

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Covering all cliques of a graph. / Tuza, Z.

In: Discrete Mathematics, Vol. 86, No. 1-3, 14.12.1990, p. 117-126.

Research output: Contribution to journalArticle

Tuza, Z. / Covering all cliques of a graph. In: Discrete Mathematics. 1990 ; Vol. 86, No. 1-3. pp. 117-126.
@article{3abdff65464c4759b3ceee5b6d209842,
title = "Covering all cliques of a graph",
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.",
author = "Z. Tuza",
year = "1990",
month = "12",
day = "14",
doi = "10.1016/0012-365X(90)90354-K",
language = "English",
volume = "86",
pages = "117--126",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Covering all cliques of a graph

AU - Tuza, Z.

PY - 1990/12/14

Y1 - 1990/12/14

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

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

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

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

U2 - 10.1016/0012-365X(90)90354-K

DO - 10.1016/0012-365X(90)90354-K

M3 - Article

VL - 86

SP - 117

EP - 126

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -