Covering the cliques of a graph with vertices

P. Erdős, Tibor Gallai, Z. Tuza

Research output: Contribution to journalArticle

49 Citations (Scopus)

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 languageEnglish
Pages (from-to)279-289
Number of pages11
JournalDiscrete Mathematics
Volume108
Issue number1-3
DOIs
Publication statusPublished - Oct 28 1992

Fingerprint

Clique
Undirected Graph
Subgraph
Cardinality
Covering
Inclusion
Graph in graph theory
Vertex of a graph

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

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

In: Discrete Mathematics, Vol. 108, No. 1-3, 28.10.1992, p. 279-289.

Research output: Contribution to journalArticle

Erdős, P. ; Gallai, Tibor ; Tuza, Z. / Covering the cliques of a graph with vertices. In: Discrete Mathematics. 1992 ; Vol. 108, No. 1-3. pp. 279-289.
@article{24eb7b8d7c804599b995970019ab53da,
title = "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.",
author = "P. Erdős and Tibor Gallai and Z. Tuza",
year = "1992",
month = "10",
day = "28",
doi = "10.1016/0012-365X(92)90681-5",
language = "English",
volume = "108",
pages = "279--289",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

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

VL - 108

SP - 279

EP - 289

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -