On Ramsey numbers for paths versus wheels

Discrete Mathematics

Volumn 307, Issue 7-8, 2007, Pages 975-982

  Salman, A N M ^a   Broersma, H J ^b  

^a BANDUNG INSTITUTE OF TECHNOLOGY   (Indonesia)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Path; Ramsey number; Wheel

Indexed keywords

GRAPH THEORY; INTEGER PROGRAMMING; WHEELS;

NONTRIVIAL LOWER BOUNDS; POSITIVE INTEGER; RAMSEY NUMBER; SUBGRAPH;

NUMBER THEORY;

EID: 33846543109     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2005.11.049     Document Type: Article

References (10)

1. Chartrand G., and Lesniak L. Graphs and Digraphs (1996), Chapman & Hall, London
2. Y.J. Chen, Y.Q. Zhang, K.M. Zhang, The Ramsey numbers of paths versus wheels, preprint, 2002.
3. Faudree R.J., Lawrence S.L., Parsons T.D., and Schelp R.H. Path-cycle Ramsey numbers. Discrete Math. 10 (1974) 269-277
4. Faudree R.J., Schelp R.H., and Simonovits M. On some Ramsey type problems connected with paths, cycles and trees. Ars Combin. 29A (1990) 97-106
5. Geréncser L., and Gyárfás A. On Ramsey-type problems. Ann. Univ. Sci. Budapest., Eötvös Sect. Math. 10 (1967) 167-170
6. Häggkvist R. On the path-complete bipartite Ramsey numbers. Discrete Math. 75 (1989) 243-245
7. n). Discrete Math. 6 (1973) 159-162
8. Parsons T.D. Path-star Ramsey numbers. J. Combin. Theory, Ser. B 17 (1974) 51-58
9. Salman A.N.M., and Broersma H.J. Path-fan Ramsey numbers. Discrete Appl. Math. 154 (2006) 1429-1436
10. 5, Proceedings of the 12th Australasian Workshop on Combinatorial Algorithms, 2001, pp. 174-178.