Perfect graphs of strong domination and independent strong domination
From MaRDI portal
Publication:1841911
DOI10.1016/S0012-365X(00)00116-3zbMath0972.05037MaRDI QIDQ1841911
Dieter Rautenbach, Vadim E. Zverovich
Publication date: 7 November 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
complexitydominationperfectforbidden induced subgraph characterizationstrong dominationindependent strong domination
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)
Related Items (9)
The Hadwiger number, chordal graphs and \(ab\)-perfection ⋮ On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs ⋮ Common domination perfect graphs ⋮ \(\alpha \)-domination perfect trees ⋮ A note on an induced subgraph characterization of domination perfect graphs ⋮ Independent strong domination in complementary prisms ⋮ The strong domination problem in block graphs and proper interval graphs ⋮ Independent strong weak domination: A mathematical programming approach ⋮ On weakly connected domination in graphs. II.
This page was built for publication: Perfect graphs of strong domination and independent strong domination
