On -sparse graphs and other families
From MaRDI portal
Publication:3439147
Cites work
- scientific article; zbMATH DE number 3906240 (Why is no real title available?)
- scientific article; zbMATH DE number 1375569 (Why is no real title available?)
- scientific article; zbMATH DE number 1262783 (Why is no real title available?)
- A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
- Dominating cliques in \(P_ 5\)-free graphs
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- Four classes of perfectly orderable graphs
- On graphs with limited number of \(P_{4}\)-partners
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
This page was built for publication: On -sparse graphs and other families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439147)