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 numberirredundance numberirredundance perfect graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)

Related Items (2)

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

This page was built for publication: A disproof of Henning's conjecture on irredundance perfect graphs