Abstract
In 1978, Chvátal and Thomassen showed that every bridgeless graph with diameter 2 has an orientation with diameter at most 6. They also gave general bounds on the smallest value such that every bridgeless graph with diameter has an orientation with diameter at most . For , they proved that . Until recently, Kwok, Liu and West improved the above bounds by proving in [P.K. Kwok, Q. Liu and D.B. West, Oriented diameter of graphs with diameter 3, J. Combin. Theory Ser.B 100(2010), 265-274]. In this paper, we determine the oriented diameter among the bridgeless graphs with diameter 3 that have minimum number of edges.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.