An upper bound for the radius of a 3-con
β
Jochen Harant
π
Article
π
1993
π
Elsevier Science
π
English
β 286 KB
For a 3-connected graph with radius r containing n vertices, in [1] r < n/4 + O(log n) was proved and r < n/4 + const was conjectured. Here we prove r < n/4 + 8. Let G be a simple 3-connected finite graph on n vertices with vertex set V(G) and edge set E(G). For X, YE V(G) we denote by d(X, Y) the