Reconstructing graphs with vertices of degree $k$ and $k-1$

Not many people work on the classical reconstruction conjecture these days, probably because only very difficult subproblems remain. The only recent good result I am aware of is this one by Brignall, Georgiou, and Waters.

About degrees 2 and 3, it could be tested by computer up to about 22 vertices. Would that be useful?