research
∙
09/20/2023
Decycling cubic graphs
A set of vertices of a graph G is said to be decycling if its removal le...
share
research
∙
12/08/2021
Morphology of small snarks
The aim of this paper is to classify all snarks up to order 36 and expla...
research
∙
01/30/2019
The smallest nontrivial snarks of oddness 4
The oddness of a cubic graph is the smallest number of odd circuits in a...
research
∙
12/21/2017