A semi-induced subgraph characterization of upper domination perfect graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199905)31:1<29::AID-JGT4>3.0.CO;2-G" /><29::AID-JGT4>3.0.CO;2-G 10.1002/(SICI)1097-0118(199905)31:1<29::AID-JGT4>3.0.CO;2-GzbMath0920.05060OpenAlexW4252854745MaRDI QIDQ4242732

Igor Edm. Zverovich, Vadim E. Zverovich

Publication date: 15 September 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199905)31:1<29::aid-jgt4>3.0.co;2-g

zbMATH Keywords

independencecharacterizationperfect graphsdominationforbidden induced subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (8)

The price of connectivity for dominating set: upper bounds and complexity ⋮ On graphs for which the connected domination number is at most the total domination number ⋮ Independence and upper irredundance in claw-free graphs ⋮ \(\alpha \)-domination perfect trees ⋮ Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs ⋮ Edge Weighting Functions on Dominating Sets ⋮ Edge weighting functions on semitotal dominating sets ⋮ Irredundance

Cites Work

• Properties of Hereditary Hypergraphs and Middle Graphs
• Algebraic Graph Theory

This page was built for publication: A semi-induced subgraph characterization of upper domination perfect graphs