Richard H. Schelp

Publication Activity (10 Years)

Years Active: 1973-2018
Publications (10 Years): 1

Top Venues

Ars Comb.

J. Comb. Theory, Ser. B

Discret. Math.

Publications

Paul Balister, Hao Li, Richard H. Schelp
Decompositions of graphs into cycles with chords. J. Comb. Theory, Ser. B 128 (2018)
Richard H. Schelp, Kiyoshi Yoshimoto
An Extremal Problem Resulting in Many Paths. Ars Comb. 116 (2014)
Richard H. Schelp
Some Ramsey-Turán type problems and related questions. Discret. Math. 312 (14) (2012)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Richard H. Schelp
Long rainbow cycles in proper edge-colorings of complete graphs. Australas. J Comb. 50 (2011)
Paul N. Balister, Ervin Györi, Richard H. Schelp
Coloring vertices and edges of a graph by nonempty subsets of a set. Eur. J. Comb. 32 (4) (2011)
H. Li, Vladimir Nikiforov, Richard H. Schelp
A new class of Ramsey-Turán problems. Discret. Math. 310 (24) (2010)
András Gyárfás, Gábor N. Sárközy, Richard H. Schelp
Multipartite Ramsey numbers for odd cycles. J. Graph Theory 61 (1) (2009)
Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
Connected graphs without long paths. Discret. Math. 308 (19) (2008)
Vladimir Nikiforov, Richard H. Schelp
Cycles and stability. J. Comb. Theory, Ser. B 98 (1) (2008)
András Gyárfás, Jenö Lehel, Gábor N. Sárközy, Richard H. Schelp
Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs. J. Comb. Theory, Ser. B 98 (2) (2008)
Guantao Chen, Richard H. Schelp
Decomposition of bipartite graphs into special subgraphs. Discret. Appl. Math. 155 (3) (2007)
Ralph J. Faudree, Richard H. Schelp, Akira Saito, Ingo Schiermeyer
Degree conditions for hamiltonicity: Counting the number of missing edges. Discret. Math. 307 (7-8) (2007)
András Gyárfás, Jenö Lehel, Richard H. Schelp
Finding a monochromatic subgraph or a rainbow path. J. Graph Theory 54 (1) (2007)
Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
Adjacent Vertex Distinguishing Edge-Colorings. SIAM J. Discret. Math. 21 (1) (2007)
Vladimir Nikiforov, Richard H. Schelp
Making the components of a graph k-connected. Discret. Appl. Math. 155 (3) (2007)
Vladimir Nikiforov, Richard H. Schelp
Cycle lengths in graphs with large minimum degree. J. Graph Theory 52 (2) (2006)
Paul N. Balister, Jenö Lehel, Richard H. Schelp
Ramsey unsaturated and saturated graphs. J. Graph Theory 51 (1) (2006)
Paul N. Balister, András Gyárfás, Jenö Lehel, Richard H. Schelp
Mono-multi bipartite Ramsey numbers, designs, and matrices. J. Comb. Theory, Ser. A 113 (1) (2006)
Vladimir Nikiforov, Richard H. Schelp
Cycles and paths in graphs with large minimal degree. J. Graph Theory 47 (1) (2004)
Paul N. Balister, Alexandr V. Kostochka, Hao Li, Richard H. Schelp
Balanced edge colorings. J. Comb. Theory, Ser. B 90 (1) (2004)
Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
Longest Paths in Circular Arc Graphs. Comb. Probab. Comput. 13 (3) (2004)
Rao Li, Richard H. Schelp
Every 3-connected distance claw-free graph is Hamilton-connected. Discret. Math. 268 (1-3) (2003)
Paul N. Balister, O. M. Riordan, Richard H. Schelp
Vertex-distinguishing edge colorings of graphs. J. Graph Theory 42 (2) (2003)
Ralph J. Faudree, Zdenek Ryjácek, Richard H. Schelp
On local and global independence numbers of a graph. Discret. Appl. Math. 132 (1-3) (2003)
Paul Balister, Béla Bollobás, Oliver Riordan, Richard H. Schelp
Graphs with large maximum degree containing no odd cycles of a given length. J. Comb. Theory, Ser. B 87 (2) (2003)
Zdenek Ryjácek, Richard H. Schelp
Contractibility techniques as a closure concept. J. Graph Theory 43 (1) (2003)
Ervin Györi, Vladimir Nikiforov, Richard H. Schelp
Nearly bipartite graphs. Discret. Math. 272 (2-3) (2003)
Béla Bollobás, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
Random induced graphs. Discret. Math. 248 (1-3) (2002)
Ervin Györi, Richard H. Schelp
Two-edge colorings of graphs with bounded degree in both colors. Discret. Math. 249 (1-3) (2002)
Paul N. Balister, Béla Bollobás, Richard H. Schelp
Vertex distinguishing colorings of graphs with Delta(G)=2. Discret. Math. 252 (1-3) (2002)
Richard H. Schelp
Three edge-coloring conjectures. Discuss. Math. Graph Theory 22 (1) (2002)
Paul N. Balister, Richard H. Schelp, Miklós Simonovits
A note on Ramsey size-linear graphs. J. Graph Theory 39 (1) (2002)
Rao Li, Richard H. Schelp
}-free graphs. Discret. Math. 245 (1-3) (2002)
Rao Li, Akira Saito, Richard H. Schelp
Relative length of longest paths and cycles in 3-connected graphs. J. Graph Theory 37 (3) (2001)
Béla Bollobás, Jair Donadelli, Yoshiharu Kohayakawa, Richard H. Schelp
Ramsey minimal graphs. J. Braz. Comput. Soc. 7 (3) (2001)
Zdenek Ryjácek, Akira Saito, Richard H. Schelp
Claw-free graphs with complete closure. Discret. Math. 236 (1-3) (2001)
Ralph J. Faudree, Evelyne Flandrin, Michael S. Jacobson, Jeno Lehel, Richard H. Schelp
Even Cycles in Graphs with Many Odd Cycles. Graphs Comb. 16 (4) (2000)
Béla Bollobás, Alexandr V. Kostochka, Richard H. Schelp
Local and Mean Ramsey Numbers for Trees. J. Comb. Theory, Ser. B 79 (1) (2000)
Richard H. Schelp, Andrew Thomason
On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs. J. Graph Theory 33 (2) (2000)
Rao Li, Richard H. Schelp
-graphs. Discret. Math. 223 (1-3) (2000)
Yoshimi Egawa, Ralph J. Faudree, Ervin Györi, Yoshiyasu Ishigami, Richard H. Schelp, Hong Wang
Vertex-Disjoint Cycles Containing Specified Edges. Graphs Comb. 16 (1) (2000)
Zdenek Ryjácek, Akira Saito, Richard H. Schelp
Closure, 2-factors, and cycle coverings in claw-free graphs. J. Graph Theory 32 (2) (1999)
Béla Bollobás, Oliver Riordan, Zdenek Ryjácek, Akira Saito, Richard H. Schelp
Closure and Hamiltonian-connectivity of claw-free graphs. Discret. Math. 195 (1-3) (1999)
Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
The number of cycle lengths in graphs of given minimum degree and girth. Discret. Math. 200 (1-3) (1999)
Richard H. Schelp, Andrew Thomason
A Remark on the Number of Complete and Empty Subgraphs. Comb. Probab. Comput. 7 (2) (1998)
András Gyárfás, Richard H. Schelp
A Communication Problem and Directed Triple Systems. Discret. Appl. Math. 85 (2) (1998)
Guantao Chen, András Gyárfás, Richard H. Schelp
Vertex colorings with a distance restriction. Discret. Math. 191 (1-3) (1998)
Richard H. Schelp
-Ramsey numbers for complete graphs. J. Graph Theory 24 (3) (1997)
Guantao Chen, Richard H. Schelp, Warren E. Shreve
A special k-coloring for a connected k-chromatic graph. Discret. Math. 170 (1-3) (1997)
Guantao Chen, Richard H. Schelp, Lubomír Soltés
Graphs with given odd sets. J. Graph Theory 24 (1) (1997)
Guantao Chen, Paul Erdös, András Gyárfás, Richard H. Schelp
A Class of Edge Critical 4-Chromatic Graphs. Graphs Comb. 13 (2) (1997)
Guantao Chen, Richard H. Schelp, Warren E. Shreve
A New Game Chromatic Number. Eur. J. Comb. 18 (1) (1997)
Anita C. Burris, Richard H. Schelp
Vertex-distinguishing proper edge-colorings. J. Graph Theory 26 (2) (1997)
Guantao Chen, Richard H. Schelp, Lubomír Soltés
Special monochromatic trees in two-colored complete graphs. J. Graph Theory 24 (1) (1997)
Paul Erdös, Talmage James Reid, Richard H. Schelp, William Staton
Sizes of graphs with induced subgraphs of large maximum degree. Discret. Math. 158 (1-3) (1996)
Odile Favaron, Hao Li, Richard H. Schelp
Strong edge colorings of graphs. Discret. Math. 159 (1-3) (1996)
Ralph J. Faudree, András Gyárfás, Richard H. Schelp
An edge coloring problem for graph products. J. Graph Theory 23 (3) (1996)
Paul Erdös, Ralph J. Faudree, Talmage James Reid, Richard H. Schelp, William Staton
Degree sequence and independence in K(4)-free graphs. Discret. Math. 141 (1-3) (1995)
Guantao Chen, Lisa R. Marcus, Richard H. Schelp
Vertex disjoint cycles for star free graphs. Australas. J Comb. 11 (1995)
Guantao Chen, Richard H. Schelp
-free graphs. J. Graph Theory 20 (4) (1995)
Heiko Harborth, Ingrid Mengersen, Richard H. Schelp
). Australas. J Comb. 11 (1995)
Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
A local density condition for triangles. Discret. Math. 127 (1-3) (1994)
Guantao Chen, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp
Neighborhood unions and the cycle cover number of a graph. J. Graph Theory 18 (7) (1994)
Ralph J. Faudree, Richard H. Schelp, Linda M. Lesniak, András Gyárfás, Jenö Lehel
On the rotation distance of graphs. Discret. Math. 126 (1-3) (1994)
R. A. Clapsadle, Richard H. Schelp
Local edge colorings that are global. J. Graph Theory 18 (4) (1994)
Guantao Chen, Richard H. Schelp
Hamiltonian graphs with neighborhood intersections. J. Graph Theory 18 (5) (1994)
Guantao Chen, Richard H. Schelp
Graphs with Linearly Bounded Ramsey Numbers. J. Comb. Theory, Ser. B 57 (1) (1993)
Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
Ramsey Size Linear Graphs. Comb. Probab. Comput. 2 (1993)
P. Bedrossian, Guantao Chen, Richard H. Schelp
A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness. Discret. Math. 115 (1-3) (1993)
Guantao Chen, Richard H. Schelp
Ramsey Problems With Bounded Degree Spread. Comb. Probab. Comput. 2 (1993)
Ralph J. Faudree, András Gyárfás, Linda M. Lesniak, Richard H. Schelp
Rainbow coloring the cube. J. Graph Theory 17 (5) (1993)
Paul Erdös, Guantao Chen, Cecil C. Rousseau, Richard H. Schelp
Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs. Eur. J. Comb. 14 (3) (1993)
László Csaba, Ralph J. Faudree, András Gyárfás, Jenö Lehel, Richard H. Schelp
Networks communicating for each pairing of terminals. Networks 22 (7) (1992)
Guantao Chen, Richard H. Schelp
Hamiltonian graphs involving distances. J. Graph Theory 16 (2) (1992)
Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
Subgraphs of minimal degree k. Discret. Math. 85 (1) (1990)
Ralph J. Faudree, András Gyárfás, Richard H. Schelp, Zsolt Tuza
Induced matchings in bipartite graphs. Discret. Math. 78 (1-2) (1989)
Ralph J. Faudree, Richard H. Schelp, Michael S. Jacobson, Jenö Lehel
Irregular networks, regular graphs and integer matrices with distinct row and column sums. Discret. Math. 76 (3) (1989)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp
Neighborhood unions and hamiltonian properties in graphs. J. Comb. Theory, Ser. B 47 (1) (1989)
Paul Erdös, Ralph J. Faudree, András Gyárfás, Richard H. Schelp
Domination in colored complete graphs. J. Graph Theory 13 (6) (1989)
Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
Extremal theory and bipartite graph-tree Ramsey numbers. Discret. Math. 72 (1-3) (1988)
Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
Small order graph-tree Ramsey numbers. Discret. Math. 72 (1-3) (1988)
Richard H. Schelp, Miklós Simonovits, Vera T. Sós
Intersection Theorems for t-Valued Functions. Eur. J. Comb. 9 (6) (1988)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp
Extremal problems involving neighborhood unions. J. Graph Theory 11 (4) (1987)
András Gyárfás, Jeno Lehel, Richard H. Schelp, Zsolt Tuza
Ramsey numbers for local colorings. Graphs Comb. 3 (1) (1987)
Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
A Ramsey problem of Harary on graphs with prescribed size. Discret. Math. 67 (3) (1987)
András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza
-colorings of graphs and hypergraphs. J. Comb. Theory, Ser. B 43 (2) (1987)
Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp, Ronald J. Gould, Michael S. Jacobson
Goodness of trees for generalized books. Graphs Comb. 3 (1) (1987)
Ralph J. Faudree, Richard H. Schelp, Vera T. Sós
Some intersection theorems on two valued functions. Comb. 6 (4) (1986)
Stefan A. Burr, Ralph J. Faudree, Richard H. Schelp
On Graphs with Ramsey-Infinite Blocks. Eur. J. Comb. 6 (2) (1985)
Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
Multipartite graph - space graph Ramsey numbers. Comb. 5 (4) (1985)
András Gyárfás, Cecil C. Rousseau, Richard H. Schelp
An extremal problem for paths in bipartite graphs. J. Graph Theory 8 (1) (1984)
Stefan A. Burr, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
On Ramsey numbers involving starlike multipartite graphs. J. Graph Theory 7 (4) (1983)
Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
Ramsey-minimal graphs for forests. Discret. Math. 38 (1) (1982)
Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
Graphs with certain families of spanning trees. J. Comb. Theory, Ser. B 32 (2) (1982)
Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
Ramsey-minimal graphs for star-forests. Discret. Math. 33 (3) (1981)
Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
All triangle-graph ramsey numbers for connected graphs of order six. J. Graph Theory 4 (3) (1980)
Ralph J. Faudree, Richard H. Schelp, J. Sheehan
Ramsey numbers for matchings. Discret. Math. 32 (2) (1980)
Ralph J. Faudree, Richard H. Schelp
Some connected ramsey numbers. J. Graph Theory 2 (2) (1978)
Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
On cycle - Complete graph ramsey numbers. J. Graph Theory 2 (1) (1978)
Ralph J. Faudree, Richard H. Schelp
Ramsey numbers for all linear forests. Discret. Math. 16 (2) (1976)

Richard H. Schelp.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Richard H. Schelp