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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A Characterization of P6‐Free Irredundance Perfect Graphs

Vadim E. Zverovich, Lutz Volkmann, Pavel Skums
Journal of Graph Theory
Advanced Graph Theory Research
article

A Characterization of P6‐Free Irredundance Perfect Graphs

Vadim E. Zverovich, Lutz Volkmann, Pavel Skums
article en

Abstract

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.

Journal of Graph Theory
University of Connecticut (US), University of the West of England (GB), RWTH Aachen University (DE)
National Science Foundation
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon