A Characterization of Domination Reducible Graphs

Authors:
Igor Ed. Zverovich
Affiliations:
The State University of New Jersey, RUTCOR–Rutgers Center for Operations Research, Rutgers, USA
Venue:
Graphs and Combinatorics
Year:
2004

Citing 0
Cited 3

Independent domination in hereditary classes

Theoretical Computer Science
All minimal prime extensions of hereditary classes of graphs

Theoretical Computer Science
Substitution-closed pattern classes

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a hereditary class of domination reducible graphs where the minimum dominating set problem is polynomially solvable, and characterize this class in terms of forbidden induced subgraphs.