Some variations of perfect graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 146666 (Why is no real title available?)
- scientific article; zbMATH DE number 617203 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Graph Classes: A Survey
- Minimum \(k\)-path vertex cover
- On graphs with equal domination and covering numbers
- On weakly connected domination in graphs. II.
- Perfect connected-dominant graphs
Cited in
(6)- Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
- On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs
- Graphs with equal domination and covering numbers
- The weighted \(k\)-path vertex cover problem on series-parallel graphs
- A note onKi-perfect graphs
- Bipartite graphs with close domination and \(k\)-domination numbers
This page was built for publication: Some variations of perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q726645)