A slim graph is any graph obtained from a Meyniel graph by removing all the edges of a given induced subgraph. Hertz introduced slim graphs and proved that they ...

Meyniel proved that a graph G is perfect if every odd cycle of G with at least five vertices has at least two chords. A slim graph is any graph obtained ...

The salient fact about even pairs is that contracting an even pair in a graph ... On slim graphs, even pairs, and star-cutsets · C. HoàngFrédéric Maffray.

Jun 10, 2024 · Disjoint clique cutsets in graphs without long holes. J. Graph ... On slim graphs, even pairs, and star-cutsets. Discret. Math. 105(1-3) ...

Aug 8, 2017 · On slim graphs, even pairs and star-cutsets. Discrete Mathematics ... Even pairs in bull-reducible graphs. In: Graph Theory in Paris ...

Slim graphs. Graphs Combin. 5 no.2 149-157 (1989) ZMath 0677.05065. 1260, C.T. Hoang, F. Maffray On slim graphs, even pairs and star-cutsets. Discrete Math. 105 ...

As every induced subgraph of a probe split graph is again a probe split graph, probe split graphs can ... On slim graphs, even pairs, and star-cutsets. Discrete ...

The Even Pair Lemma, proved by Meyniel, states that no minimal imperfect graph ... On slim graphs, even pairs, and star-cutsets. Article. Aug 1992.

On slim graphs, even pairs, and star-cutsets. 93-102. view. electronic edition ... Matching and covering the vertices of a random graph by copies of a given graph ...

Aug 22, 2000 · Conforti, (K4-e)-free perfect graphs and star cutsets ... Maffray, On slim graphs, even pairs, and star-cutsets, Discrete Math.