Decreasing the diameter of bounded degree graphs

Journal of Graph Theory

Volumn 35, Issue 3, 2000, Pages 161-172

  Alon, Noga ^a   Gyárfás, András ^b   Ruszinkó, Miklós ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

Diameter of graphs; Graphs; Maximum degree

Indexed keywords

EID: 0042689506     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0118(200011)35:3<161::AID-JGT1>3.0.CO;2-Y     Document Type: Article

References (6)

1. F. R. K. Chung, Diameters of graphs: old problems and new results, Congr Numer 60 (1987), 295-317.
2. F. R. K. Chung and M. R. Garey, Diameter bounds for altered graphs, J Graph Theory 8 (1984), 511-534.
3. P. Erdös, A. Gyárfás, and M. Ruszinkó, How to decrease the diameter of triangle-free graphs, Combinatorica, 18 (1998), 493-501.
4. P. Erdös and A. Rényi, On a problem in the Theory of Graphs (in Hungarian), Publ Math Inst Hungar Acad Sci 7 (1962), 623-641.
5. P. Erdös, A. Rényi, and V. T. Sós, On a problem of Graph Theory, Studia Scientarium Mathematicarum Hungar 1 (1966), 215-235.
6. A. A. Schoone, H. L. Bodlaender, and J. van Leeuwen, Diameter increase caused by edge deletion, J Graph Theory 11 (1987), 409-427.