Dominating cliques in P5-free graphs

G. Bacsó, Zs Tuza

Research output: Contribution to journalArticle

82 Citations (Scopus)


All induced connected subgraphs of a graph G contain a dominating set of pair-wise adjacent vertices if and only if there is no induced subgraph isomorphic to a path or a cycle of five vertices in G. Moreover, the problem of finding any given type of connected dominating sets in all members of a class G of graphs can be reduced to the graphs G∈G that have a cut-vertex or do not contain any cutset S dominated by some s∈S.

Original languageEnglish
Pages (from-to)303-308
Number of pages6
JournalPeriodica Mathematica Hungarica
Issue number4
Publication statusPublished - Dec 1 1990


  • AMS subject classification (1985/85): Primary

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Dominating cliques in P<sub>5</sub>-free graphs'. Together they form a unique fingerprint.

  • Cite this