Minimal Non-Neighborhood-Perfect Graphs

András Gyárfás, Dieter Kratsch, Jenö Lehel, Frederic Maffray

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Neighborhood-perfect graphs form a subclass of the perfect graphs if the Strong Perfect Graph Conjecture of C. Berge is true. However, they are still not shown to be perfect. Here we propose the characterization of neighborhood-perfect graphs by studying minimal non-neighborhood-perfect graphs (MNNPG). After presenting some properties of MNNPGs, we show that the only MNNPGs with neighborhood independence number one are the 3-sun and 3K2. Also two further classes of neighborhood-perfect graphs are presented: line-graphs of bipartite graphs and a 3K2- free cographs.

Original languageEnglish
Pages (from-to)55-66
Number of pages12
JournalJournal of Graph Theory
Volume21
Issue number1
DOIs
Publication statusPublished - Jan 1996

    Fingerprint

ASJC Scopus subject areas

  • Geometry and Topology

Cite this