How to decrease the diameter of triangle-free graphs

Combinatorica

Volumn 18, Issue 4, 1998, Pages 493-501

  Erdos, Paul ^c   Gyárfás, András ^a   Ruszinkó, Miklós ^a,b  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040689686     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930050035     Document Type: Article

References (14)

1. N. ALON: Covering graphs by the minimum number of equivalence relations, Combinatorica 6(3) (1986), 201-206.
2. N. ALON, A. GYÁRFÁS, M. RUSZINKÓ: Decreasing the diameter of bounded degree graphs, submitted.
3. D. DE CAEN, D. A. GREGORY, N. J. PULLMAN: Clique coverings of complements of paths and cycles, Annals of Discrete Mathematics 27 (1985), 257-268.
4. P. ERDOS: On a theorem of Rademacher-Turán, Illinos J. Math., 6 (1962), 122-127.
5. P. ERDOS: Some old and new problems in various branches of combinatorics, Discrete Mathematics, 165/166 (1997), 227-231.
6. P. ERDOS, A. W. GOODMAN, L. PÓSA: The representation of a graph by set intersections, Canad. J. Math., 18 (1966), 106-112.
7. R. J. FAUDREE, A. GYÁRFÁS, R. H. SCHELP, ZS. TUZA: The strong chromatic index of graphs, Ars Combinatoria 29B (1990), 205-211.
8. D. A. GREGORY, N. J. PULLMAN: On a Clique Covering Problem of Orlin, Discrete Mathematics, 41 (1982), 97-99.
9. E. GYORI, A. V. KOSTOCHKA: On a Problem of G. O. H. Katona and T. Tarján, Acta Math. Acad. Sci. Hungar. 34(3-4) (1979), 321-327.
10. A. KÉZDY: Personal communication.
11. M. SIMONOVITS: Extremal Graph Problems with Symmetrical Extremal Graphs, Additional Chromatic Conditions, Discrete Mathematics, 7 (1974), 349-376.
12. T. G. TARJÁN: Complexity of lattice-configurations, Studia Sci. Math. Hungar., 10 (1975), 203-211.
13. P. TURÁN: On an extremal problem in graph theory (in Hungarian), Mat. Fiz. Lapok, 48 (1941), 436-452.
14. ZS. TUZA: Applications of the Set-pair Method in Extremal Problems, II. In: Combinatorics, Paul Erdos is Eighty, Volume 2, Bolyai Society Math. Studies 2. 459-490.