On slim graphs, even pairs, and star-cutsets (Q1199476)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On slim graphs, even pairs, and star-cutsets |
scientific article |
Statements
On slim graphs, even pairs, and star-cutsets (English)
0 references
16 January 1993
0 references
A Meyniel graph is a perfect graph in which every odd cycle with at least five vertices has at least two chords. A slim graph is any graph obtained from a Meyniel graph by removing all the edges of a given induced subgraph. The authors prove that every slim graph derived from an \(i\)- triangulated graph is a strict quasi-parity graph.
0 references
triangulated graph
0 references
parity graph
0 references
perfect graph
0 references
slim graph
0 references
