On a Class of P 5 -Free Graphs
From MaRDI portal
Publication:3476848
Recommendations
Cites work
Cited in
(13)- On the number of \(C_ 5's\) in a triangle-free graph
- On minimal imperfect graphs without induced P₅
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\)
- On the closure of graphs under substitution
- On the structure of (\(P_{5}\),\,gem)-free graphs
- On the quasi-locally paw-free graphs
- Split-neighbourhood graphs and the strong perfect graph conjecture
- A note on efficient domination in a superclass of \(P_5\)-free graphs
- A characterization of \(P_5\)-free, diameter-2-critical graphs
- Sequential NP₅, IP₅, MP₅ graphs
- scientific article; zbMATH DE number 915922 (Why is no real title available?)
- scientific article; zbMATH DE number 2192137 (Why is no real title available?)
- scientific article; zbMATH DE number 2227376 (Why is no real title available?)
This page was built for publication: On a Class of P 5 -Free Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3476848)