You can see this visually by drawing the nodes equally spaced around a circle (which achieves
2-regularity), then drawing chords between vertices opposite each other on the circle. The graph
constructed is well-defined and 3-regular.
Thus for any even n > 2, there is a 3-regular graph on n nodes.