Let be a bridgeless cubic

Let $ G $ be a bridgeless cubic graph. The oddness of a 2-factor $ F $ is the number of odd circuits of $ F $. The oddness of $ G $ is the smallest oddness over all 2-factors. For example, a 3-edge-colorable cubic graph has oddness zero and the Petersen graph has oddness two.


Comments are limited to a maximum of 1000 characters.
More information about formatting options