All Ramsey numbers r(K3,G) for connected graphs of order 9

Electronic Journal of Combinatorics

Volumn 5, Issue 1, 1998, Pages

  Brandt, Stephan ^a   Brinkmann, Gunnar ^b   Harmuth, Thomas ^b  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039355837     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1345     Document Type: Article

References (16)

1. S. BRANDT, Expanding graphs and Ramsey numbers, submitted.
2. S. BRANDT, G. BRINKMANN, T. HARMUTH, The generation of maximal triangle-free graphs, submitted.
3. 3,G) for connected graphs of order 7 and 8, to appear in Combinatorics, Probability and Computing.
4. S. A. BURR, Ramsey numbers involving graphs with long suspended paths, J. London Math. Soc. (2) 24 (1981), 11-20.
5. S. A. BURR, P. ERDOS, R. J. FAUDREE, C. C. ROUSSEAU AND R. H. SCHELP, An extremal problem in generalized Ramsey theory, Ars Comb. 10 (1980), 193-203.
6. S. A. BURR, P. ERDOS, R. J. FAUDREE, C. C. ROUSSEAU AND R. H. SCHELP, The Ramsey number for the pair complete bipartite graph - graph of limited degree, in: Graph Theory with Applications to Algorithms and Computer Science (Alavi et. al., eds.) Wiley, 1985, 163-174.
7. V. CHVÁTAL, Tree - complete graph Ramsey numbers, J. Graph Theory 1 (1977), 93.
8. R. J. FAUDREE, C. C. ROUSSEAU AND R. H. SCHELP, All triangle - graph Ramsey numbers for connected graphs of order 6, J. Graph Theory 1 (1980), 293-300.
9. R. J. FAUDREE, C. C. ROUSSEAU AND R. H. SCHELP, Problems in graph theory from Memphis, in: The mathematics of Paul Erdos, Vol. II (R. L. Graham, J. Nešetřil eds.), Springer, 1996, pp. 7-26.
10. JIN XIA, Ramsey numbers involving a triangle: theory and applications, M.Sc. thesis, Dept. of Computer Sci., Rochester institute of Technology, 1993.
11. 2/log t, Random Structures & Algorithms 7 (1995), 173-207.
12. B. D. McKAY, Isomorph-free exhaustive generation, to appear in Journal of Algorithms.
13. B. D. McKAY, Autoson, a distributed batch system for UNIX workstations networks, Technical report TR-CS-96-03, Comp. Sci. Dept. Australian National University, 1996. http://cs.anu.edu.au/~bdm/autoson/
14. S. P. RADZISZOWSKI, Small Ramsey numbers, Dynamic Survey of Electronic J. Comb. (1994). http://www.combinatorics.org/Surveys/index.html
15. 3, G) for connected graphs of order seven, to appear in Discr. Appl. Math.
16. 2, to appear in Discr. Math.