New examples of minimal non-strongly-perfect graphs

Research output: Contribution to journalArticlepeer-review


A graph is strongly perfect if every induced subgraph H has a stable set that meets every nonempty maximal clique of H. The characterization of strongly perfect graphs by a set of forbidden induced subgraphs is not known. Here we provide several new minimal non-strongly-perfect graphs.

Original languageEnglish (US)
Article number112334
JournalDiscrete Mathematics
Issue number5
StatePublished - May 2021

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


  • Forbidden induced subgraph characterization
  • New minimal examples
  • Strongly perfect graphs


Dive into the research topics of 'New examples of minimal non-strongly-perfect graphs'. Together they form a unique fingerprint.

Cite this