All Outputs (2)

Proof of a conjecture on irredundance perfect graphs (2002)
Journal Article
Volkmann, L., & Zverovich, V. (2002). Proof of a conjecture on irredundance perfect graphs. Journal of Graph Theory, 41(4), 292-306. https://doi.org/10.1002/jgt.10068

Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = γ(H), for every induced subgraph H of G. In this article we present a result which immediately imp... Read More about Proof of a conjecture on irredundance perfect graphs.

A disproof of Henning's conjecture on irredundance perfect graphs (2002)
Journal Article
Volkmann, L., & Zverovich, V. (2002). A disproof of Henning's conjecture on irredundance perfect graphs. Discrete Mathematics, 254(1-3), 539-554. https://doi.org/10.1016/S0012-365X%2801%2900300-4

Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = γ(H), for every induced subgraph H of G. In this paper, we disprove the known conjecture of Hennin... Read More about A disproof of Henning's conjecture on irredundance perfect graphs.