Favaron's forbidden-subgraph conjecture for irredundance perfect graphs

Let $G$ be a graph, and let $P_6$, $G_1$, and $G_2$ be the graphs described in Figure 5 of the source. Favaron's conjecture. If $G$ does not contain $P_6$, $G_1$, or $G_2$ as induced subgraphs, then $G$ is irredundance perfect. The conjecture was later completely proved, and a stronger result is known using $P_6$, $G_1$, and $G_5$ instead; it is therefore solved.