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.
Authors
- Vadim E. Zverovich (ORCID: https://orcid.org/0009-0001-2671-9588)
- Lutz Volkmann (ORCID: https://orcid.org/0000-0003-3496-277X)
- Pavel Skums (ORCID: https://orcid.org/0000-0003-4007-5624)
Institutions
- University of Connecticut (US)
- University of the West of England (GB)
- RWTH Aachen University (DE)
Publication Details
- Journal
- Journal of Graph Theory
- Published
- 2026-11-13
- DOI
- https://doi.org/10.1002/jgt.70149
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation