A disproof of Henning's conjecture on irredundance perfect graphs

DOI10.1016/S0012-365X(01)00300-4zbMath1008.05073WikidataQ123019300 ScholiaQ123019300MaRDI QIDQ1613565

Lutz Volkmann, Vadim E. Zverovich

Publication date: 29 August 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

domination number; irredundance number; irredundance perfect graph

Mathematics Subject Classification ID

05C75: Structural characterization of families of graphs

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C17: Perfect graphs

Related Items

Variations of \(Y\)-dominating functions on graphs