On slim graphs, even pairs, and star-cutsets

From MaRDI portal
(Redirected from Publication:1199476)





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.











This page was built for publication: On slim graphs, even pairs, and star-cutsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199476)