The minimum oriented diameter bound in terms of vertex-cover number
Let be a bridgeless connected graph, and let denote its vertex-cover number. Define the minimum oriented diameter by
Minimum oriented diameter conjecture.
The paper proves the upper bound and presents the displayed formula as the expected true upper bound; its status is not resolved in the supplied text.
References
Primary source
Sascha Kurz and Martin Laetsch, “Bounds for the minimum oriented diameter”, arXiv:0804.1294 (2008).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.