  A Hist in a cubic graph $G$ is a spanning tree $T$ which has only vertices of
degree three and one. A snark with a Hist is called a Hist-snark, see
\cite{HO}. We present several computer generated Hist-snarks which form
generalizations of the Petersen graph. Moreover, we state some results on
Hist-snarks which have been achieved with computer support.
