Aharoni–Briggs–Kim–Kim conjecture for graphs of maximum degree two

Let $G$ be a graph, let $n$ and $m$ be integers with $m\le n$, and let $f_G(n,m)$ denote the minimum number of independent $n$-sets whose collection has a rainbow independent $m$-set. Let $\mathcal{D}(2)$ be the family of graphs with maximum degree at most two. Aharoni–Briggs–Kim–Kim conjecture.

$$f_{\mathcal{D}(2)}(n,n-1)=n-1.$$

This asserts that the general lower bound $f_G(n,m)\ge m$ is tight for graphs of maximum degree at most two when $m=n-1$. The source gives no resolution evidence for this assertion.