Weak oddness as an approximation of oddness and resistance in cubic graphs

Robert Lukoťka, Ján Mazák

We introduce weak oddness ${\omega }_{\text{w}}$, a new measure of uncolourability of cubic graphs, defined as the least number of odd components in an even factor. For every bridgeless c…