Explicit subcubic graphs of unbounded twin-width

Construct an explicit family of subcubic graphs whose twin-width is unbounded.

Background

The class of subcubic graphs is known to have unbounded twin-width, but the known proof is indirect and relies on counting the number of labelled graphs. The survey identifies an explicit construction of such a family as an unresolved combinatorial problem.