Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-24T01:45:50.999Z Has data issue: false hasContentIssue false
  • English
  • Français

My Friend and Colleague, Richard Schelp

Published online by Cambridge University Press:  02 February 2012

Ralph J. Faudree
Ralph J. Faudree*
Affiliation:
University of Memphis, USA
Get access Rights & Permissions [Opens in a new window]

Extract

Richard Schelp completed his PhD in lattice theory in 1970 at Kansas State University. However, he did not take a traditional route to a PhD in mathematics and an outstanding career as a professor and a mathematical researcher. He grew up in rural northeast Missouri. He received his BS in mathematics and physics from the University of Central Missouri. After the completion of his master's degree in mathematics from Kansas State University, he assumed a position as an associate mathematician in the Applied Science Laboratory at Johns Hopkins University for five years. To start his PhD programme at Kansas State University, he had to quit a well-paying position. Also, he was already married to his wife Billie (Swopes) Schelp and he had a family – a daughter Lisa and a son Rick. This was a courageous step to take, but it says something about who Dick Schelp was.

Type
Introduction
Information
Combinatorics, Probability and Computing , Volume 21 , Issue 1-2: Honouring the Memory of Richard H. Schelp , March 2012 , pp. 1 - 9
Copyright
Copyright © Cambridge University Press 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Balister, P., Bollobás, B., Riordan, O. and Schelp, R. (2003) Graphs with large maximum degree containing no odd cycles of a given length. J. Combin. Theory Ser. B 87 366–373.CrossRefGoogle Scholar
[2]Bedrossian, P. (1991) Forbidden subgraph and minimum degree conditions for hamiltonicity. PhD thesis, Memphis State University.Google Scholar
[3]Bondy, J. A. and Erdős, P. (1973) Ramsey numbers for cycles in graphs. J. Combin. Theory Ser. B 14 46–54.CrossRefGoogle Scholar
[4]Burr, S. A., Erdős, P., Faudree, R., Gould, R., Jacobson, M., Rousseau, C. C. and Schelp, R. (1987) Goodness of trees for generalized books. Graphs Combin. 3 1–6.CrossRefGoogle Scholar
[5]Chen, G. and Schelp, R. (1993) Graphs with linearly bounded Ramsey numbers. J. Combin. Theory Ser. B 57 138–149.Google Scholar
[6]Erdős, P., Faudree, R., Rousseau, C. C. and Schelp, R. (1976) Generalized Ramsey theory for multiple colors. J. Combin. Theory Ser. B 20 250–264.Google Scholar
[7]Faudree, R., Gould, R., Jacobson, M. and Schelp, R. (1989) Neighborhood unions and Hamiltonian properties in graphs. J. Combin. Theory Ser. B 47 1–9.CrossRefGoogle Scholar
[8]Faudree, R. and Schelp, R. (1974) All Ramsey numbers for cycles in graphs. Discrete Math. 8 313–329.CrossRefGoogle Scholar
[9]Gyárfás, A., Lehel, J., Nešetril, J., Rödl, V., Schelp, R. and Tuza, Z. (1987) Local k-colorings of graphs and hypergraphs. J. Combin. Theory Ser. B 43 127–139.Google Scholar