Sum-perfect graphs

From MaRDI portal
(Redirected from Publication:1735702)




Abstract: Inspired by a famous characterization of perfect graphs due to Lov'{a}sz, we define a graph G to be sum-perfect if for every induced subgraph H of G, alpha(H)+omega(H)geq|V(H)|. (Here alpha and omega denote the stability number and clique number, respectively.) We give a set of 27 graphs and we prove that a graph G is sum-perfect if and only if G does not contain any of the graphs in the set as an induced subgraph.









This page was built for publication: Sum-perfect graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1735702)