Perfect graph decompositions

Research output: Contribution to journalArticle

1 Citation (Scopus)


Upper and lower bounds are given for the minimum number of perfect (induced or partial) subgraphs covering or partitioning the vertex set or the edge set of a graph of n vertices. Also, weighted versions of the problems are investigated.

Original languageEnglish
Pages (from-to)89-93
Number of pages5
JournalGraphs and Combinatorics
Issue number1
Publication statusPublished - Mar 1 1991

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Perfect graph decompositions'. Together they form a unique fingerprint.

  • Cite this