3 problems

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

Triangle- and quadrangle-free graph conjecture. For $C_3$-free graphs and $C_4$-free graphs, the minimum oriented diameter is at most

Minimum oriented diameter conjecture.