Fruit salad

Electronic Journal of Combinatorics

Volumn 4, Issue 1 R, 1997, Pages 1-8

  Gyárfás, András ^a  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4043118537     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/1293     Document Type: Article

References (12)

1. [A] B. Andrásfai, On Critical Graphs, in Theory of Graphs, International Symposium, Rome, 1966 Ed.: P. Rosenstiehl, Gordon and Breach, New York, 1967, 1-9.
2. [BJ] W.G. Brown, H.A. Jung, On odd circuits in chromatic graphs, Acta Math. Acad. Sci. Hungar. 20, (1969) 129-134.
3. [EFRS] P. Erdös, R.J. Faudree, C.C. Rousseau, R.H. Schelp, On Cycle-Complete Graph Ramsey Numbers, Journal of Graph Theory, 2 (1978) 53-64.
4. [EJ] P. Erdös, M.S. Jacobson, in preparation.
5. [FOL] J.H. Folkman, An upper bound on the chromatic number of a graph, Coll. Math. Soc. J. Bolyai 4. Combinatorial Theory and its Applications 437-457.
6. [FOL] J.H. Folkman, An upper bound on the chromatic number of a graph, Coll. Math. Soc. J. Bolyai 4. Combinatorial Theory and its Applications 437-457.
7. [FOW] T. Fowler, Finding Large Monochromatic Diameter Two Subgraphs. Manuscript.
8. [JS] T.R. Jensen, F.B. Shepherd, Note on a conjecture of Toft, Combinatorica, 3, (1995) 373-377.
9. 4 and 4-chromatic graphs, Monatsh. Math. 89 (1980) 101-110.
10. L. Lovász, Combinatorial Problems and Exercises, North Holland, Amsterdam, 1979.
11. [S] L. Soltes, personal communication
12. [T] B. Toft, Problem 11, in Recent Advances in Graph Theory ,Academia Praha 1975, 543-544.