Page
%P
![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter
Long Cycles and the Codiameter of a Graph II
The codiameter of a graph, introduced and studied in [2], is the minimum, taken over all pairs of vertices x and y in the graph, of the maximum length of an (x, y)- path. Further results on the codiameter, and...