2017/10/16 by Hoffmann-Ostenhof, Arthur, Jatschka, Thomas
#05Cxx #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1710.05663
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 \citeHO. 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.