Small snarks with large oddness

Robert Lukotka, Edita Macajova, Jan Mazak +1

We estimate the minimum number of vertices of a cubic graph with given oddness and cyclic connectivity. We prove that a bridgeless cubic graph $G$ with oddness $\omega (G)$ other than th…