A Characterization of P6‐Free Irredundance Perfect Graphs
Journal of Graph Theory · 13.11.2026
DOI: 10.1002/jgt.70149 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 13.11.2026. Verfasst von Vadim Zverovich und 2 weiteren Autor:innen. Die Arbeit nennt 16 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Science Foundation.
Abstract (Originalsprache)
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.
Förderung
- National Science Foundation
Zitieren
APA
Zverovich, V., Skums, P., & Volkmann, L. (2026). A Characterization of P6‐Free Irredundance Perfect Graphs. Journal of Graph Theory. https://doi.org/10.1002/jgt.70149
Vancouver
Zverovich V, Skums P, Volkmann L. A Characterization of P6‐Free Irredundance Perfect Graphs. Journal of Graph Theory. 2026. doi:10.1002/jgt.70149
BibTeX
@article{Zverovich2026,
author = {Zverovich, Vadim and Skums, Pavel and Volkmann, Lutz},
title = {A Characterization of P6‐Free Irredundance Perfect Graphs},
journal = {Journal of Graph Theory},
year = {2026},
doi = {10.1002/jgt.70149}
}
EUVIMED