A characterization of (k)-perfect graphs
From MaRDI portal
Publication:1586777
Recommendations
Cited in
(14)- A Sum of Squares Characterization of Perfect Graphs
- Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes
- scientific article; zbMATH DE number 5844229 (Why is no real title available?)
- A characterization of graphs \(G\) with \(G\cong K^ 2(G)\)
- A characterization of normal fraternally orientable perfect graphs
- scientific article; zbMATH DE number 2073614 (Why is no real title available?)
- scientific article; zbMATH DE number 2186993 (Why is no real title available?)
- Upper domination and upper irredundance perfect graphs
- \(\alpha \)-domination perfect trees
- Some variations of perfect graphs
- A note on an induced subgraph characterization of domination perfect graphs
- Irredundance
- On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs
- Algorithmic Applications in Management
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)