Minimizing and maximizing the diameter in orientations of graphs (Q1340120)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimizing and maximizing the diameter in orientations of graphs |
scientific article; zbMATH DE number 700936
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing and maximizing the diameter in orientations of graphs |
scientific article; zbMATH DE number 700936 |
Statements
Minimizing and maximizing the diameter in orientations of graphs (English)
0 references
28 May 1995
0 references
The author shows that the maximum finite diameter of an orientation of any 2-edge connected graph \(G\) is equal to the length of a longest path in \(G\). His further results concern the minimum diameter but are not new; see the reviewer's paper [``Remarks on diameters of orientations of graphs'', Acta Math. Univ. Comenianae 46/47, 225-236 (1985; Zbl 0613.05024)].
0 references
diameter
0 references
orientation
0 references
