On slim graphs, even pairs, and star-cutsets
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.
scientific article; zbMATH DE number 94349
scientific article