Special Hist-Snarks
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 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.