Richard Schelp
Mathematician
Richard Schelp's AcademicInfluence.com Rankings
Download Badge
Mathematics
Richard Schelp's Degrees
- PhD Mathematics Princeton University
- Masters Mathematics Stanford University
- Bachelors Mathematics University of California, Berkeley
Similar Degrees You Can Earn
Why Is Richard Schelp Influential?
(Suggest an Edit or Addition)According to Wikipedia, Richard H. Schelp was an American mathematician. Schelp received his bachelor's degree in mathematics and physics from the University of Central Missouri and his master's degree and doctorate in mathematics from Kansas State University. The adviser from his thesis was Richard Joseph Greechie. He was an associate mathematician and missile scientist at Johns Hopkins University for five years. He then became an instructor of mathematics at Kansas State University for four years. Finally in 1970 he became a professor of mathematics in the Department of Mathematical Sciences at the University of Memphis. He retired in 2001.
Richard Schelp's Published Works
Published Works
- All Ramsey numbers for cycles in graphs (1974) (217)
- The size Ramsey number (1978) (201)
- Vertex-distinguishing proper edge-colorings (1997) (188)
- Adjacent Vertex Distinguishing Edge-Colorings (2007) (150)
- Path Ramsey numbers in multicolorings (1975) (122)
- Induced matchings in bipartite graphs (1989) (122)
- Graphs with Linearly Bounded Ramsey Numbers (1993) (104)
- THE STRONG CHROMATIC INDEX OF GRAPHS (1990) (88)
- Neighborhood unions and hamiltonian properties in graphs (1989) (78)
- Irregular networks, regular graphs and integer matrices with distinct row and column sums (1989) (69)
- On cycle - Complete graph ramsey numbers (1978) (60)
- Path-path Ramsey-type numbers for the complete bipartite graph (1975) (55)
- Vertex-distinguishing edge colorings of graphs (2003) (54)
- Path-cycle Ramsey numbers (1974) (53)
- Vertex-Disjoint Cycles Containing Specified Edges (2000) (49)
- Ramsey numbers for local colorings (1987) (49)
- Vertex‐distinguishing edge colorings of graphs (2003) (46)
- Connected graphs without long paths (2008) (44)
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs (2008) (43)
- Some Complete Bipartite Graph - Tree Ramsey Numbers (1988) (42)
- Closure, 2-factors, and cycle coverings in claw-free graphs (1999) (39)
- Strong edge colorings of graphs (1996) (38)
- A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness (1993) (38)
- Longest Paths in Circular Arc Graphs (2004) (35)
- Ramsey-minimal graphs for star-forests (1981) (34)
- Generalized Ramsey theory for multiple colors (1976) (34)
- Ramsey-minimal graphs for forests (1982) (34)
- Local k-colorings of graphs and hypergraphs (1987) (34)
- An extremal problem for paths in bipartite graphs (1984) (33)
- Networks communicating for each pairing of terminals (1992) (28)
- All triangle-graph ramsey numbers for connected graphs of order six (1980) (25)
- A local density condition for triangles (1994) (25)
- Cycles and stability (2006) (24)
- Closure and Hamiltonian-connectivity of claw-free graphs (1999) (23)
- AN EXTREMAL PROBLEM IN GENERALIZED RAMSEY THEORY (1980) (23)
- Subgraphs of minimal degree k (1990) (23)
- Extremal problems involving neighborhood unions (1987) (22)
- Ramsey-minimal graphs for multiple copies (1978) (22)
- Ramsey numbers for the pair sparse graph-path or cycle (1982) (22)
- Multipartite graph—Sparse graph Ramsey numbers (1985) (22)
- A CLASS OF RAMSEY-FINITE GRAPHS (2004) (21)
- The square of a block is strongly path connected (1976) (21)
- Domination in colored complete graphs (1989) (20)
- Some Ramsey-Turán type problems and related questions (2012) (20)
- Balanced edge colorings (2004) (20)
- A Ramsey problem of Harary on graphs with prescribed size (1987) (19)
- Hamiltonicity for K1, r-free graphs (1995) (19)
- Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs (1993) (18)
- Goodness of trees for generalized books (1987) (17)
- A Remark on the Number of Complete and Empty Subgraphs (1998) (16)
- Finding a monochromatic subgraph or a rainbow path (2007) (15)
- The number of cycle lengths in graphs of given minimum degree and girth (1999) (15)
- Long rainbow cycles in proper edge-colorings of complete graphs (2011) (15)
- Coordinatization of orthocomplemented and orthomodular posets (1970) (14)
- Book Ramsey Numbers and Quasi-Randomness (2005) (14)
- Relative length of longest paths and cycles in 3‐connected graphs (2001) (14)
- Contractibility techniques as a closure concept (2003) (14)
- Some problems in ramsey theory (1978) (13)
- Cycle lengths in graphs with large minimum degree (2006) (13)
- Ramsey-Minimal Graphs for Matchings (1981) (13)
- On the rotation distance of graphs (1994) (13)
- Theory of path length distributions I (1973) (13)
- Local and mean k-Ramsey numbers for complete graphs (1997) (12)
- Path connected graphs (1974) (12)
- Coloring vertices and edges of a graph by nonempty subsets of a set (2011) (12)
- RAMSEY-MINIMAL GRAPHS FOR THE PAIR STAR , CONNECTED GRAPH (12)
- Vertex colorings with a distance restriction (1998) (12)
- Graphs with large maximum degree containing no odd cycles of a given length (2003) (11)
- Ramsey unsaturated and saturated graphs (2006) (11)
- Rainbow coloring the cube (1993) (10)
- The Book-Tree Ramsey Numbers (2004) (10)
- Edge-disjoint Hamiltonian cycles (1985) (10)
- Nearly bipartite graphs (2003) (10)
- Small order graph-tree Ramsey numbers (1988) (10)
- RAMSEY NUMBERS FOR BROOMS by (10)
- Extremal theory and bipartite graph-tree Ramsey numbers (1988) (10)
- Irregularity strength of uniform hypergraphs (1992) (9)
- A new type of Ramsey-Turan problems (2010) (9)
- On Ramsey numbers involving starlike multipartite graphs (1983) (9)
- Some intersection theorems on two-valued functions (1986) (9)
- Ramsey Problems with Bounded Degree Spread (1993) (9)
- Ramsey numbers for all linear forests (1976) (9)
- A new class of Ramsey-Turán problems (2010) (9)
- Mono-multi bipartite Ramsey numbers, designs, and matrices (2006) (9)
- A New Game Chromatic Number (1997) (8)
- Hamiltonian graphs with neighborhood intersections (1994) (8)
- Claw-free graphs with complete closure (2001) (8)
- Local and Mean Ramsey Numbers for Trees (2000) (8)
- Multipartite Ramsey numbers for odd cycles (2009) (7)
- On Graphs with Ramsey-Infinite Blocks (1985) (7)
- Ramsey Size Linear Graphs (1993) (7)
- Hamiltonian graphs involving distances (1992) (7)
- Degree sequence and independence in K(4)-free graphs (1995) (7)
- Ramsey minimal graphs (2001) (7)
- Ramsey numbers for matchings (1980) (7)
- A Communication Problem and Directed Triple Systems (1998) (6)
- Degree conditions for hamiltonicity: Counting the number of missing edges (2007) (6)
- A Class of Edge Critical 4-Chromatic Graphs (1997) (6)
- Local and mean k -Ramsey numbers for complete graphs (1997) (6)
- The drawing Ramsey number Dr(Kn) (1995) (5)
- Vertex disjoint cycles for star free graphs (1995) (5)
- A Partial Semigroup Approach to Partially Ordered Sets (1972) (5)
- Decompositions of graphs into cycles with chords (2018) (5)
- Local edge colorings that are global (1994) (5)
- Some connected ramsey numbers (1978) (5)
- Relative length of longest paths and cycles in 3-connected graphs (2001) (5)
- Sizes of graphs with induced subgraphs of large maximum degree (1996) (5)
- On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs (2000) (5)
- Studies related to the Ramsey number r(K 5 -e) (1985) (4)
- An Extremal Result for Paths a (1989) (4)
- Graphs with certain families of spanning trees (1982) (4)
- The Entire Graph of a Bridgeless Connected Plane Graph is Panconnected (1975) (3)
- Various length paths in graphs (1978) (3)
- A special k-coloring for a connected k-chromatic graph (1997) (3)
- Problems in Graph Theory from Memphis (2013) (3)
- Cycles and paths in graphs with large minimal degree (2004) (3)
- A note on Ramsey size‐linear graphs (2002) (2)
- Essentially Infinite Colourings of Graphs (2000) (2)
- Two-edge colorings of graphs with bounded degree in both colors (2002) (2)
- Intersection Theorems for t-Valued Functions (1988) (2)
- Random induced graphs (2002) (2)
- THE STRONG CHROMATIC INDEX OF GRAPHS R : (2)
- Some hamiltonian properties of L1-graphs (2000) (2)
- Combinatorics, Geometry and Probability: Ramsey Size Linear Graphs (1997) (1)
- Panarboreal graphs (1980) (1)
- Neighborhood unions and the cycle cover number of a graph (1994) (1)
- Two-Irregular Graphs (1990) (1)
- Even Cycles in Graphs with Many Odd Cycles (2000) (1)
- AN EXTREMAL PROBLEM FOR COMPLETE BIPARTITE GRAPHS (1988) (1)
- Graphs with given odd sets (1997) (1)
- Making the components of a graph k-connected (2007) (1)
- TREE-MULTIPARTITE GRAPH RAMSEY NUMBERS (1)
- Extremal Problems for Degree Sequences (2004) (1)
- On Graphs Of Irregularity Strength 2 (2011) (1)
- A note on Ramsey size-linear graphs (2002) (1)
- Every 3-connected distance claw-free graph is Hamilton-connected (2003) (1)
- On local and global independence numbers of a graph (2003) (1)
- Decomposition of bipartite graphs into special subgraphs (2007) (0)
- An edge coloring problem for graph products (1996) (0)
- An Extremal Problem Resulting in Many Paths (2014) (0)
- Even cycles in graphs with many odd (2001) (0)
- BIPACKING A BIPARTITE GRAPH WITH GIRTH AT LEAST 12 (2018) (0)
- e/m Experiment Analysis Refinement (2011) (0)
- A Conjecture on the Classical Ramsey Number (2002) (0)
- Three edge-coloring conjectures (2002) (0)
- Special monochromatic trees in two-colored complete graphs (1997) (0)
- Cycles and Stability ( full version ) (2008) (0)
- A partial Baer *-semigroup of relations (1975) (0)
- A Solved and Unsolved Graph Coloring Problem (P. Erdös) (1973) (0)
- A Sunvpv oF RESULTS oN THE SIZE Rentspv NuMepn (2016) (0)
- Combinatorics, Geometry and Probability: Ramsey Problems with Bounded Degree Spread (1997) (0)
This paper list is powered by the following services:
Other Resources About Richard Schelp
What Schools Are Affiliated With Richard Schelp?
Richard Schelp is affiliated with the following schools: