Journal of Graph Theory Дискретная математика и комбинаторика
A Characterization of P6‐Free Irredundance Perfect Graphs
Аннотация
ABSTRACT Let and denote the irredundance number and the domination number of a graph , respectively. A graph is said to be irredundance perfect if for every induced subgraph of . The class of ‐free irredundance perfect graphs has been studied extensively in the literature. In this paper, we provide a characterization of this class in terms of eleven forbidden induced subgraphs.