A characterization of (k)-perfect graphs

DOI10.1016/S0012-365X(00)00137-0zbMATH Open0976.05042OpenAlexW2074204978MaRDI QIDQ1586777FDOQ1586777

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 graphsforbidden induced subgraphupper domination numberupper irredundance number\(\Gamma \alpha (k)\)-perfect graphs

Mathematics Subject Classification ID

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

Cited In (11)

• Upper domination and upper irredundance perfect graphs
• A characterization of normal fraternally orientable perfect graphs
• On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs
• A Sum of Squares Characterization of Perfect Graphs
• Algorithmic Applications in Management
• Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes
• Title not available (Why is that?)
• \(\alpha \)-domination perfect trees
• A characterization of graphs \(G\) with \(G\cong K^ 2(G)\)
• Irredundance
• A note on an induced subgraph characterization of domination perfect graphs

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A semi-induced subgraph characterization of upper domination perfect graphs 👍 👎
• Upper domination and upper irredundance perfect graphs 👍 👎
• k-Bounded classes of dominant-independent 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)