A characterization of \(\Gamma\alpha(k)\)-perfect graphs

DOI10.1016/S0012-365X(00)00137-0zbMath0976.05042OpenAlexW2074204978MaRDI QIDQ1586777

Lothar Dohmen, Lutz Volkmann, Dieter Rautenbach

Publication date: 10 December 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00137-0

zbMATH Keywords

characterizationindependence numberperfect graphsupper irredundance numberforbidden induced subgraphupper domination number\(\Gamma \alpha (k)\)-perfect graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)

Related Items (4)

On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs ⋮ \(\alpha \)-domination perfect trees ⋮ A note on an induced subgraph characterization of domination perfect graphs ⋮ Irredundance

This page was built for publication: A characterization of \(\Gamma\alpha(k)\)-perfect graphs