2 problems

Kurz–Lätsch conjecture. For every bridgeless graph $G$ with $\gamma(G)=\gamma$,

Minimum oriented diameter conjecture.