  In a recent paper, Cho and Kim proved that in subcubic graphs, the
independent domination number is at most three times the packing number. They
subsequently posed the question of characterizing subcubic graphs that achieve
this bound. In this paper, we completely solve the question by proving that
exactly four graphs meet this bound.
