Minimum Order of a CND Graph

Determine the minimum order of a connected, nontraceable, detour graph.

Background

The thesis establishes that CND graphs have order at least 10 and constructs examples for all orders greater than 17, while leaving the exact minimum order undetermined. This problem asks for the sharp lower bound and, implicitly, an example attaining it.