Covering All Cliques of a Graph

Research output: Contribution to journalArticle

3 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
JournalAnnals of Discrete Mathematics
Volume48
Issue numberC
DOIs
Publication statusPublished - 1991

Fingerprint

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

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Cite this

Covering All Cliques of a Graph. / Tuza, Z.

In: Annals of Discrete Mathematics, Vol. 48, No. C, 1991, p. 117-126.

Research output: Contribution to journalArticle

Tuza, Z. / Covering All Cliques of a Graph. In: Annals of Discrete Mathematics. 1991 ; Vol. 48, No. C. pp. 117-126.
@article{b38cda4633394a35b2993facdad6a1bc,
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 = "1991",
doi = "10.1016/S0167-5060(08)71043-4",
language = "English",
volume = "48",
pages = "117--126",
journal = "Annals of Discrete Mathematics",
issn = "0167-5060",
publisher = "Elsevier",
number = "C",

}

TY - JOUR

T1 - Covering All Cliques of a Graph

AU - Tuza, Z.

PY - 1991

Y1 - 1991

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=77957767702&partnerID=8YFLogxK

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

U2 - 10.1016/S0167-5060(08)71043-4

DO - 10.1016/S0167-5060(08)71043-4

M3 - Article

VL - 48

SP - 117

EP - 126

JO - Annals of Discrete Mathematics

JF - Annals of Discrete Mathematics

SN - 0167-5060

IS - C

ER -