Radius, diameter, and minimum degree

Journal of Combinatorial Theory, Series B - Tập 47 - Trang 73-79 - 1989
Paul Erdős1,2, János Pach1,2, Richard Pollack1,2, Zsolt Tuza1,2
1Hungarian Academy of Sciences, Budapest, Hungary
2Courant Institute of Mathematical Sciences, New York 10012 USA

Tài liệu tham khảo

Amar, 1983, Ordre minimum d'un graphe simple de diametre, degre minimum et connexite donnes, Ann. Discrete Math., 17, 7 Bermond, 1981, The diameter of graphs—A survey, 32, 3 Bollobás, 1978 Brown, 1966, On graphs that do not contain a Thomsen graph, Canad. Math. Bull., 9, 281, 10.4153/CMB-1966-036-2 Erdős, 1962, On a problem in the theory of graphs, Publ. Math. Inst. Hungar. Acad. Sci., 7 Erdős, 1966, On a problem of graph theory, Studia Sci. Math. Hungar., 1, 215 T. Gallai, personal communication.