2000 character limit reached
Special Hist-Snarks (1710.05663v1)
Published 16 Oct 2017 in math.CO
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.