Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs

We determine the smallest claw-free, 2-connected, nontraceable graphs and use one of these graphs to construct a new family of 2-connected, claw-free, maximal nontraceable graphs.