research
∙
05/03/2023
Frank number and nowhere-zero flows on graphs
An edge e of a graph G is called deletable for some orientation o if the...
share
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
