Kurz–Lätsch conjecture on oriented diameter and domination number
Kurz–Lätsch conjecture. For every bridgeless graph GGG with γ(G)=γ\gamma(G)=\gammaγ(G)=γ,
The minimum oriented diameter bound in terms of vertex-cover number
Minimum oriented diameter conjecture.
MathDB