✦ LIBER ✦

Minimal non-neighborhood-perfect graphs

✍ Scribed by András Gyárfás; Dieter Kratsch; Jenö Lehel; Frederic Maffray

Book ID: 119982762
Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 738 KB
Volume: 21
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199601)21:1<55::aid-jgt8>3.0.co;2-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Neighborhood perfect graphs

✍ J Lehel; Zs Tuza 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 595 KB

The notion of neighborhood perfect graphs is introduced here as follows. Let G be a graph, ~N(G) denote the maximum number of edges such that no two of them belong to the same subgraph of G induced by the (closed) neighborhood of some vertex; let PN(G) be the minimum number of vertices whose neighbo

On perfect neighborhood sets in graphs

✍ Gerd H. Fricke; Teresa W. Haynes; Sandra Hedetniemi; Stephen T. Hedetniemi; Mich 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 279 KB

Split-Neighborhood Graphs and the Strong

Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture

✍ F. Maffray; M. Preissmann 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 649 KB

We introduce the class of graphs such that every induced subgraph possesses a vertex whose neighbourhood can be split into a clique and a stable set. We prove that this class satisfies Berge's strong perfect graph conjecture. This class contains several well-known classes of (perfect) graphs and is

Minimally non-Pfaffian graphs

✍ Serguei Norine; Robin Thomas 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 378 KB

Graphs of Non-Crossing Perfect Matchings

✍ C. Hernando; F. Hurtado; Marc Noy 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 256 KB

On minimal non [h,2,1] graphs

✍ Alcón, Liliana; Gutierrez, Marisa; Pía Mazzoleni, María 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 182 KB