| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6424129 | European Journal of Combinatorics | 2015 | 8 Pages |
Abstract
We show that every bridgeless graph of order n and minimum degree δ has a strongly connected orientation of diameter at most 11δ+1n+9, and such an orientation can be found in polynomial time.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Sheng Bau, Peter Dankelmann,