A characterization of (k)-perfect graphs
From MaRDI portal
Recommendations
Cited in
(15)- Upper domination and upper irredundance perfect graphs
- A characterization of normal fraternally orientable perfect graphs
- On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs
- scientific article; zbMATH DE number 2186993 (Why is no real title available?)
- Some variations of perfect graphs
- A Sum of Squares Characterization of Perfect Graphs
- scientific article; zbMATH DE number 2073614 (Why is no real title available?)
- Algorithmic Applications in Management
- Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes
- \(\alpha \)-domination perfect trees
- scientific article; zbMATH DE number 5844229 (Why is no real title available?)
- A characterization of graphs G with G K^ 2(G)
- k-Bounded classes of dominant-independent perfect graphs
- Irredundance
- A note on an induced subgraph characterization of domination perfect graphs
This page was built for publication: A characterization of \(\Gamma\alpha(k)\)-perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1586777)