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.
Recommendations
Cites work
- A new property of critical imperfect graphs and some consequences
- scientific article; zbMATH DE number 3889564 (Why is no real title available?)
- scientific article; zbMATH DE number 3889583 (Why is no real title available?)
- scientific article; zbMATH DE number 3152801 (Why is no real title available?)
- scientific article; zbMATH DE number 3168327 (Why is no real title available?)
- scientific article; zbMATH DE number 3214398 (Why is no real title available?)
- scientific article; zbMATH DE number 3315022 (Why is no real title available?)
- Locally perfect graphs
- Normal hypergraphs and the perfect graph conjecture
- On rigid circuit graphs
- On the perfect graph conjecture
- Slim graphs
- Star-cutsets and perfect graphs
Cited in
(6)
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)