MathDB2 problems
- 0 votes0 replies1 view
Bujtás–Jendrol–Tuza conjecture on strong parity factors
Bujtás–Jendrol–Tuza conjecture. Every 2-edge-connected graph with minimum degree at least three has the strong parity property.
- 0 votes0 replies0 views
The minimum-degree-three conjecture for strong parity property
Minimum-degree-three conjecture. Every 2-edge-connected graph of minimum degree at least three has the strong parity property.