Sum-perfect graphs

From MaRDI portal
Publication:1735702

DOI10.1016/J.DAM.2018.12.015zbMATH Open1407.05098arXiv1710.07546OpenAlexW2765711561MaRDI QIDQ1735702FDOQ1735702


Authors: Bart Litjens, Vaidy Sivaraman, Sven C. Polak Edit this on Wikidata


Publication date: 28 March 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1710.07546




Recommendations




Cites Work


Cited In (9)





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)