2 problems

Two-orientation deletability conjecture. For every cubic $3$-edge-connected graph $G$, there exist two strongly connected orientations $D_1$ and $D_2$ of $G$ such that for every ve…

Cover inequality. Then