A set of vertices of a graph G is said to be decycling if its removal
le...
The aim of this paper is to classify all snarks up to order 36 and expla...
The oddness of a cubic graph is the smallest number of odd circuits in a...
The family of snarks -- connected bridgeless cubic graphs that cannot be...
share