MathDB1 problem
Minimum-degree-three conjecture. Every 2-edge-connected graph of minimum degree at least three has the strong parity property.
Minimum-degree-three conjecture. Every 2-edge-connected graph of minimum degree at least three has the strong parity property.