On the smallest snarks with oddness 4 and connectivity 2 (Q1753089): Difference between revisions

Summary: A \textit{snark} is a bridgeless cubic graph which is not 3-edge-colourable. The \textit{oddness} of a bridgeless cubic graph is the minimum number of odd components in any 2-factor of the graph. \textit{R. Lukoťka} et al. showed in [Electron. J. Comb. 22, No. 1, Research Paper P1.51, 20 p. (2015; Zbl 1308.05051)] that the smallest snark with oddness 4 has 28 vertices and remarked that there are exactly two such graphs of that order. However, this remark is incorrect as -- using an exhaustive computer search -- we show that there are in fact three snarks with oddness 4 on 28 vertices. In this note we present the missing snark and also determine all snarks with oddness 4 up to 34 vertices.