1. Upper bounds on distance measures in K3,3-free graphs;Dankelmann;Util. Math.,2005
2. P. Dankelmann, G. Dlamini, H.C. Swart, Distances in K2,l-free graphs, submitted for publication
3. An upper bound on the radius of a 3-edge-connected graph;Dankelmann;Util. Math.,2007
4. P. Dankelmann, H.C. Swart, P. van den Berg, The number of edges in a bipartite graph of given radius, submitted for publication
5. Radius of (2k−1)-connected graphs;Egawa;Ars Combin.,1999