  We prove that the ladder with $3$~rungs and the house graph have the
edge-Erd\H{o}s-P\'{o}sa property, while ladders with $14$~rungs or more have
not. Additionally, we prove that the latter bound is optimal in the sense that
the only known counterexample graph does not permit a better result.
