Special Hist-Snarks
classification
🧮 math.CO
keywords
hist-snarkscomputergraphhistachievedbeencalledcite
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.