2020/03/04 by Chudnovsky, Maria, Dibek, Cemil, Seymour, Paul
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2003.01846
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.