Special Hist-Snarks
Combinatorics
2017-10-17 v1
Abstract
A Hist in a cubic graph is a spanning tree 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.
Cite
@article{arxiv.1710.05663,
title = {Special Hist-Snarks},
author = {Arthur Hoffmann-Ostenhof and Thomas Jatschka},
journal= {arXiv preprint arXiv:1710.05663},
year = {2017}
}