TY - JOUR
T1 - New examples of minimal non-strongly-perfect graphs
AU - Chudnovsky, Maria
AU - Dibek, Cemil
AU - Seymour, Paul
N1 - Funding Information:
Supported by NSF, United States of America Grant DMS-1763817. This material is based upon work supported by, or in part by, the U.S. Army Research Laboratory and the U.S. Army Research Office under grant number W911NF-16-1-0404.Supported by AFOSR, United States of America grant A9550-19-1-0187 and NSF, United States of America grant DMS-1800053.
Publisher Copyright:
© 2021 Elsevier B.V.
PY - 2021/5
Y1 - 2021/5
N2 - 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.
AB - 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.
KW - Forbidden induced subgraph characterization
KW - New minimal examples
KW - Strongly perfect graphs
UR - http://www.scopus.com/inward/record.url?scp=85100899236&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85100899236&partnerID=8YFLogxK
U2 - 10.1016/j.disc.2021.112334
DO - 10.1016/j.disc.2021.112334
M3 - Article
AN - SCOPUS:85100899236
SN - 0012-365X
VL - 344
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 5
M1 - 112334
ER -