Showing math.COShow all
2 papers · 1 filter
math.CO2020
New Examples of Minimal Non-Strongly-Perfect Graphs
Maria Chudnovsky, Cemil Dibek, Paul Seymour
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…
math.CO2019
Strongly Perfect Claw-free Graphs -- A Short Proof
Maria Chudnovsky, Cemil Dibek
A graph is strongly perfect if every induced subgraph H has a stable set that meets every maximal clique of H. A graph is claw-free if no vertex has three pairwise non-adjacent nei…