Authors
Citation
J. Harant, AN UPPER BOUND FOR THE RADIUS OF A 3-CONNECTED GRAPH, Discrete mathematics, 122(1-3), 1993, pp. 335-341
Citations number
3
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
ISSN journal
0012365X
Volume
122
Issue
1-3
Year of publication
1993
Pages
335 - 341
Database
ISI
SICI code
0012-365X(1993)122:1-3<335:AUBFTR>2.0.ZU;2-9
Abstract
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 less-than-or-equal-to n/4 + 8.