default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRalph J. Faudree
Person information
- affiliation: University of Memphis, Department of Mathematical Sciences, TN, USA
- award (2005): Euler Medal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2018
[j134]Hui Du, Ralph J. Faudree, Jeno Lehel
, Kiyoshi Yoshimoto:
A panconnectivity theorem for bipartite graphs. Discret. Math. 341(1): 151-154 (2018)- [j133]Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Paul Horn, Michael S. Jacobson:
Degree sum and vertex dominating paths. J. Graph Theory 89(3): 250-265 (2018) - 2017
- [j132]Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Brent J. Thomas:
Saturation spectrum of paths and stars. Discuss. Math. Graph Theory 37(3): 811-822 (2017) - [j131]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Douglas B. West:
Minimum Degree and Dominating Paths. J. Graph Theory 84(2): 202-213 (2017) - 2016
- [j130]Ralph J. Faudree, Hao Li, Kiyoshi Yoshimoto:
Locating sets of vertices on Hamiltonian cycles. Discret. Appl. Math. 209: 107-114 (2016) - [j129]Ralph J. Faudree, Jenö Lehel, Kiyoshi Yoshimoto:
Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs. Graphs Comb. 32(3): 963-986 (2016) - [j128]Megan Cream, Ralph J. Faudree, Ronald J. Gould, Kazuhide Hirohata:
Chorded Cycles. Graphs Comb. 32(6): 2295-2313 (2016) - 2014
- [j127]Ralph J. Faudree, Ronald J. Gould:
Weak saturation numbers for multiple copies. Discret. Math. 336: 1-6 (2014) - [j126]Ralph J. Faudree, Jeno Lehel, Kiyoshi Yoshimoto:
Note on Locating Pairs of Vertices on Hamiltonian Cycles. Graphs Comb. 30(4): 887-894 (2014) - 2013
- [j125]Ralph J. Faudree, Ronald J. Gould:
A note on powers of Hamilton cycles in generalized claw-free graphs. Discret. Math. 313(19): 1915-1917 (2013) - [j124]Ralph J. Faudree, Ronald J. Gould:
Precise location of vertices on Hamiltonian cycles. Discret. Math. 313(23): 2772-2777 (2013) - [j123]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Weak saturation numbers for sparse graphs. Discuss. Math. Graph Theory 33(4): 677-693 (2013) - [j122]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Minimum degree and disjoint cycles in generalized claw-free graphs. Eur. J. Comb. 34(5): 875-883 (2013) - [j121]Ralph J. Faudree, Ronald J. Gould:
Saturation Numbers for Nearly Complete Graphs. Graphs Comb. 29(3): 429-448 (2013) - [j120]Jill R. Faudree, Ralph J. Faudree, Zdenek Ryjácek, Petr Vrána:
On Forbidden Pairs Implying Hamilton-Connectedness. J. Graph Theory 72(3): 327-345 (2013) - 2012
- [j119]Ralph J. Faudree:
My Friend and Colleague, Richard Schelp. Comb. Probab. Comput. 21(1-2): 1-9 (2012) - [j118]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Minimum Degree and Disjoint Cycles in Claw-Free Graphs. Comb. Probab. Comput. 21(1-2): 129-139 (2012) - [j117]Ralph J. Faudree, Hao Li:
Locating pairs of vertices on Hamiltonian cycles. Discret. Math. 312(17): 2700-2706 (2012) - [j116]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant:
Distributing vertices on Hamiltonian cycles. J. Graph Theory 69(1): 28-45 (2012) - [j115]Ralph J. Faudree, Colton Magnant, Kenta Ozeki, Kiyoshi Yoshimoto:
Claw-free graphs and 2-factors that separate independent vertices. J. Graph Theory 69(3): 251-263 (2012) - [j114]Ralph J. Faudree, Ronald J. Gould, Jeffrey S. Powell:
Property Pd, m and efficient design of reliable networks. Networks 60(3): 167-178 (2012) - 2010
- [j113]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant:
Ramsey numbers in rainbow triangle free colorings. Australas. J Comb. 46: 269-284 (2010) - [j112]Guantao Chen, Ralph J. Faudree, Lubomír Soltés:
Path spectra for trees. Discret. Math. 310(24): 3455-3461 (2010) - [j111]Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant:
Chvátal-Erdös type theorems. Discuss. Math. Graph Theory 30(2): 245-256 (2010) - 2009
- [j110]Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Saturation Numbers for Trees. Electron. J. Comb. 16(1) (2009) - [j109]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Pancyclic graphs and linear forests. Discret. Math. 309(5): 1178-1189 (2009) - [j108]Ralph J. Faudree, Michael Ferrara, Ronald J. Gould, Michael S. Jacobson:
tKp-saturated graphs of minimum size. Discret. Math. 309(19): 5870-5876 (2009) - [j107]Ralph J. Faudree, Linda M. Lesniak, Ingo Schiermeyer:
On the circumference of a graph and its complement. Discret. Math. 309(19): 5891-5893 (2009) - 2008
- [j106]Guantao Chen, Ralph J. Faudree, Ronald J. Gould:
Saturation Numbers of Books. Electron. J. Comb. 15(1) (2008) - [j105]Jill R. Faudree, Ralph J. Faudree, Zdenek Ryjácek:
Forbidden subgraphs that imply 2-factors. Discret. Math. 308(9): 1571-1582 (2008) - [j104]Guantao Chen, Ralph J. Faudree, Xuechao Li, Ingo Schiermeyer:
Non-path spectrum sets. J. Graph Theory 58(4): 329-350 (2008) - 2007
- [j103]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): 873-877 (2007) - 2006
- [j102]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Cycle Extendability of Hamiltonian Interval Graphs. SIAM J. Discret. Math. 20(3): 682-689 (2006) - 2005
- [j101]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito:
A note on 2-factors with two components. Discret. Math. 300(1-3): 218-224 (2005) - [j100]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Potential forbidden triples implying hamiltonicity: for sufficiently large graphs. Discuss. Math. Graph Theory 25(3): 273-289 (2005) - [j99]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Minimal Degree and (k, m)-Pancyclic Ordered Graphs. Graphs Comb. 21(2): 197-211 (2005) - 2004
- [j98]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito:
Toughness, degrees and 2-factors. Discret. Math. 286(3): 245-249 (2004) - [j97]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Forbidden triples implying Hamiltonicity: for all graphs. Discuss. Math. Graph Theory 24(1): 47-54 (2004) - [j96]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Florian Pfender:
Linear forests and ordered cycles. Discuss. Math. Graph Theory 24(3): 359-372 (2004) - [j95]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Generalizing Pancyclic and k-Ordered Graphs. Graphs Comb. 20(3): 291-309 (2004) - 2003
- [j94]Ralph J. Faudree, Zdenek Ryjácek, Richard H. Schelp:
On local and global independence numbers of a graph. Discret. Appl. Math. 132(1-3): 79-84 (2003) - [j93]Ralph J. Faudree, Annette Schelten, Ingo Schiermeyer:
The Ramsey number r(C7, C7, C7). Discuss. Math. Graph Theory 23(1): 141-158 (2003) - [j92]Ralph J. Faudree, Ronald J. Gould, Alexandr V. Kostochka, Linda M. Lesniak, Ingo Schiermeyer, Akira Saito:
Degree conditions for k-ordered hamiltonian graphs. J. Graph Theory 42(3): 199-210 (2003) - [j91]Yoshimi Egawa, Hikoe Enomoto, Ralph J. Faudree, Hao Li, Ingo Schiermeyer:
Two-factors each component of which contains a specified vertex. J. Graph Theory 43(3): 188-198 (2003) - 2002
- [j90]Jill R. Faudree, Ralph J. Faudree:
Forbidden subgraphs that imply k-ordered and k-ordered hamiltonian. Discret. Math. 243(1-3): 91-108 (2002) - [j89]Béla Bollobás, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Random induced graphs. Discret. Math. 248(1-3): 249-254 (2002) - [j88]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Characterizing forbidden clawless triples implying hamiltonian graphs. Discret. Math. 249(1-3): 71-81 (2002) - [j87]Jan Brousek, Ralph J. Faudree, Zdenek Ryjácek:
A note on hamiltonicity of generalized net-free graphs of large diameter. Discret. Math. 251(1-3): 77-85 (2002) - [j86]Hajo Broersma, Ralph J. Faudree, Andreas Huck, Huib Trommel, Henk Jan Veldman:
Forbidden subgraphs that imply hamiltonian-connectedness. J. Graph Theory 40(2): 104-119 (2002) - [j85]Guantao Chen, Ralph J. Faudree, Michael S. Jacobson:
Fragile graphs with small independent cuts. J. Graph Theory 41(4): 327-341 (2002) - 2001
- [j84]Guantao Chen, Ralph J. Faudree, Warren E. Shreve:
Weak Clique-Covering Cycles and Paths. Ars Comb. 58 (2001) - [j83]Ralph J. Faudree:
Survey of results on k-ordered graphs. Discret. Math. 229(1-3): 73-87 (2001) - [j82]Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel:
Edge disjoint monochromatic triangles in 2-colored graphs. Discret. Math. 231(1-3): 135-141 (2001) - [j81]Aart Blokhuis, Ralph J. Faudree, András Gyárfás, Miklós Ruszinkó:
Anti-Ramsey Colorings in Several Rounds. J. Comb. Theory B 82(1): 1-18 (2001) - 2000
- [j80]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Akira Saito:
2-factors in claw-free graphs. Discuss. Math. Graph Theory 20(2): 165-172 (2000) - [j79]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Cycles in 2-Factors of Balanced Bipartite Graphs. Graphs Comb. 16(1): 67-80 (2000) - [j78]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): 81-92 (2000) - [j77]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): 399-410 (2000) - [j76]Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
On k-ordered graphs. J. Graph Theory 35(2): 69-82 (2000) - 1999
- [j75]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): 55-60 (1999) - [j74]Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li, Zhenhong Liu:
On 2-factors in claw-free graphs. Discret. Math. 206(1-3): 131-137 (1999) - [j73]Ralph J. Faudree, András Gyárfás:
Extremal problems for forbidden pairs that imply hamiltonicity. Discuss. Math. Graph Theory 19(1): 13-29 (1999) - [j72]Annette Schelten, Ingo Schiermeyer, Ralph J. Faudree:
3-colored Ramsey Numbers of Odd Cycles. Electron. Notes Discret. Math. 3: 176-178 (1999) - 1998
- [j71]Guantao Chen, Ralph J. Faudree, Warren E. Shreve:
Note on Whitney's Theorem for k-connected Graphs. Ars Comb. 49 (1998) - [j70]Ralph J. Faudree, J. Sheehan:
The maximum number of edges in a graph with fixed edge-degree. Discret. Math. 183(1-3): 81-101 (1998) - [j69]Guantao Chen, Ralph J. Faudree, Ronald J. Gould:
Intersections of Longest Cycles in k-Connected Graphs. J. Comb. Theory B 72(1): 143-149 (1998) - [j68]Stephan Brandt, Ralph J. Faudree, Wayne Goddard:
Weakly pancyclic graphs. J. Graph Theory 27(3): 141-176 (1998) - 1997
- [j67]Ralph J. Faudree, Zdenek Ryjácek, Ingo Schiermeyer:
Local connectivity and cycle xtension in claw-free graphs. Ars Comb. 47 (1997) - [j66]Ralph J. Faudree, Evelyne Flandrin, Zdenek Ryjácek:
Claw-free graphs - A survey. Discret. Math. 164(1-3): 87-147 (1997) - [j65]Ralph J. Faudree, Ronald J. Gould:
Characterizing forbidden pairs for hamiltonian properties. Discret. Math. 173(1-3): 45-60 (1997) - [j64]Stephan Brandt, Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak:
Degree conditions for 2-factors. J. Graph Theory 24(2): 165-173 (1997) - 1996
- [j63]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak:
Graph spectra. Discret. Math. 150(1-3): 103-113 (1996) - [j62]Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li:
Pancyclism and small cycles in graphs. Discuss. Math. Graph Theory 16(1): 27-40 (1996) - [j61]Ralph J. Faudree, András Gyárfás, Richard H. Schelp:
An edge coloring problem for graph products. J. Graph Theory 23(3): 297-302 (1996) - [j60]Ralph J. Faudree, András Gyárfás:
Endpoint extendable paths in tournaments. J. Graph Theory 23(3): 303-307 (1996) - 1995
- [j59]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Degree conditions and cycle extendability. Discret. Math. 141(1-3): 109-122 (1995) - [j58]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): 285-290 (1995) - [j57]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Spanning caterpllars with bounded diameter. Discuss. Math. Graph Theory 15(2): 111-118 (1995) - [j56]Ralph J. Faudree, Zsolt Tuza:
Stronger bounds for generalized degress and Menger path systems. Discuss. Math. Graph Theory 15(2): 167-177 (1995) - [j55]Ralph J. Faudree, Jan van den Heuvel:
Degree sums, k-factors and hamilton cycles in graphs. Graphs Comb. 11(1): 21-28 (1995) - [j54]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Hamiltonicity in balancedk-partite graphs. Graphs Comb. 11(3): 221-231 (1995) - [j53]Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak, Terri Lindquester:
Generalized degree conditions for graphs with bounded independence number. J. Graph Theory 19(3): 397-409 (1995) - 1994
- [j52]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): 121-135 (1994) - [j51]Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau:
Extremal problems and generalized degrees. Discret. Math. 127(1-3): 139-152 (1994) - [j50]Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
A local density condition for triangles. Discret. Math. 127(1-3): 153-161 (1994) - 1993
- [j49]Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Ramsey Size Linear Graphs. Comb. Probab. Comput. 2: 389-399 (1993) - [j48]Ralph J. Faudree, Debra J. Knisley:
A neighborhood condition which implies the existence of a complete multipartite subgraph. Discret. Math. 118(1-3): 57-68 (1993) - [j47]Stefan A. Burr, Ralph J. Faudree:
On graphsG for which all large trees areG-good. Graphs Comb. 9(2-4): 305-313 (1993) - [j46]Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li:
The complete closure of a graph. J. Graph Theory 17(4): 481-494 (1993) - [j45]Ralph J. Faudree, András Gyárfás, Linda M. Lesniak, Richard H. Schelp:
Rainbow coloring the cube. J. Graph Theory 17(5): 607-612 (1993) - [j44]Haitze J. Broersma, Ralph J. Faudree, Jan van den Heuvel, Henk Jan Veldman:
Decomposition of bipartite graphs under degree constraints. Networks 23(3): 159-164 (1993) - 1992
- [j43]Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak:
Generalized Degrees and Menger Path Systems. Discret. Appl. Math. 37/38: 179-191 (1992) - [j42]Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau:
Extremal problems involving vertices and edges on odd cycles. Discret. Math. 101(1-3): 23-31 (1992) - [j41]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Terri Lindquester:
On independent generalized degrees and independence numbers in K(1, m)-free graphs. Discret. Math. 103(1): 17-24 (1992) - [j40]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Neighborhood unions and a generalization of Dirac's theorem. Discret. Math. 105(1-3): 61-71 (1992) - [j39]Ralph J. Faudree, András Gyárfás, Jenö Lehel:
Three-regular path pairable graphs. Graphs Comb. 8(1): 45-52 (1992) - [j38]Ralph J. Faudree, Miklós Simonovits:
Ramsey problems and their connection to tuŕan-type extremal problems. J. Graph Theory 16(1): 25-50 (1992) - [j37]Ralph J. Faudree:
Complete subgraphs with large degree sums. J. Graph Theory 16(4): 327-334 (1992) - [j36]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): 615-626 (1992) - 1991
- [j35]Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak:
Neighborhood conditions and edge-disjoint perfect matchings. Discret. Math. 91(1): 33-43 (1991) - [j34]Ralph J. Faudree, Michael S. Jacobson, Lael F. Kinch, Jenö Lehel:
Irregularity strength of dense graphs. Discret. Math. 91(1): 45-59 (1991) - 1990
- [j33]Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Subgraphs of minimal degree k. Discret. Math. 85(1): 53-58 (1990) - [j32]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Lower bounds for lower Ramsey numbers. J. Graph Theory 14(6): 723-730 (1990) - 1989
- [j31]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): 223-240 (1989) - [j30]Ralph J. Faudree, András Gyárfás, Richard H. Schelp, Zsolt Tuza:
Induced matchings in bipartite graphs. Discret. Math. 78(1-2): 83-87 (1989) - [j29]Ralph J. Faudree, Michael S. Jacobson, Ronald J. Gould, Linda M. Lesniak:
On a Neighborhood Condition Implying the Existence of Disjoint Complete Graphs. Eur. J. Comb. 10(5): 427-433 (1989) - [j28]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp:
Neighborhood unions and hamiltonian properties in graphs. J. Comb. Theory B 47(1): 1-9 (1989) - [j27]Paul Erdös, Ralph J. Faudree, András Gyárfás, Richard H. Schelp:
Domination in colored complete graphs. J. Graph Theory 13(6): 713-718 (1989) - 1988
- [j26]Paul Erdös, Ralph J. Faudree, Edward T. Ordman:
Clique partitions and clique coverings. Discret. Math. 72(1-3): 93-101 (1988) - [j25]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): 103-112 (1988) - [j24]Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Small order graph-tree Ramsey numbers. Discret. Math. 72(1-3): 119-127 (1988) - [j23]Paul Erdös, Ralph J. Faudree, János Pach, Joel H. Spencer:
How to make a graph bipartite. J. Comb. Theory B 45(1): 86-98 (1988) - 1987
- [j22]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): 227-233 (1987) - [j21]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): 1-6 (1987) - [j20]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp:
Extremal problems involving neighborhood unions. J. Graph Theory 11(4): 555-564 (1987) - 1986
- [j19]Ralph J. Faudree, Richard H. Schelp, Vera T. Sós:
Some intersection theorems on two valued functions. Comb. 6(4): 327-333 (1986) - 1985
- [j18]Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Multipartite graph - space graph Ramsey numbers. Comb. 5(4): 311-318 (1985) - [j17]Stefan A. Burr, Ralph J. Faudree, Richard H. Schelp:
On Graphs with Ramsey-Infinite Blocks. Eur. J. Comb. 6(2): 129-132 (1985) - 1984
- [j16]Ralph J. Faudree, J. Sheehan:
Regular graphs and edge chromatic number. Discret. Math. 48(2-3): 197-204 (1984) - 1983
- [j15]Ralph J. Faudree, Miklós Simonovits:
On a class of degenerate extremal graph problems. Comb. 3(1): 83-93 (1983) - [j14]Ralph J. Faudree, J. Sheehan:
Size Ramsey numbers involving stars. Discret. Math. 46(2): 151-157 (1983) - [j13]Ralph J. Faudree, J. Sheehan:
Size Ramsey numbers for small-order graphs. J. Graph Theory 7(1): 53-55 (1983) - [j12]Stefan A. Burr, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
On Ramsey numbers involving starlike multipartite graphs. J. Graph Theory 7(4): 395-409 (1983) - 1982
- [j11]Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Ramsey-minimal graphs for forests. Discret. Math. 38(1): 23-32 (1982) - [j10]Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Graphs with certain families of spanning trees. J. Comb. Theory B 32(2): 162-170 (1982) - 1981
- [j9]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): 227-237 (1981) - 1980
- [j8]Ralph J. Faudree, Richard H. Schelp, J. Sheehan:
Ramsey numbers for matchings. Discret. Math. 32(2): 105-123 (1980) - [j7]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): 293-300 (1980) - 1978
- [j6]Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
On cycle - Complete graph ramsey numbers. J. Graph Theory 2(1): 53-64 (1978) - [j5]Ralph J. Faudree, Richard H. Schelp:
Some connected ramsey numbers. J. Graph Theory 2(2): 119-128 (1978) - 1976
- [j4]Ralph J. Faudree, Richard H. Schelp:
Ramsey numbers for all linear forests. Discret. Math. 16(2): 149-155 (1976) - 1974
- [j3]Ralph J. Faudree, Richard H. Schelp:
All Ramsey numbers for cycles in graphs. Discret. Math. 8(4): 313-329 (1974) - [j2]Ralph J. Faudree, S. L. Lawrence, Torrence D. Parsons, Richard H. Schelp:
Path-cycle Ramsey numbers. Discret. Math. 10(2): 269-277 (1974) - 1973
- [j1]Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Theory of path length distributions I. Discret. Math. 6(1): 35-52 (1973)
Parts in Books or Collections
- 2013
- [p2]Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Problems in Graph Theory from Memphis. The Mathematics of Paul Erdős II 2013: 95-118 - 2003
- [p1]Béla Bollobás, Vladimir Nikiforov, Nicholas C. Wormald, Ralph J. Faudree, Alan M. Frieze:
Analytic Graph Theory. Handbook of Graph Theory 2003: 787-871
Coauthor Index
[j133] [j132] [j131] [j128] [j127] [j125] [j124] [j123] [j122] [j121] [j118] [j116] [j114] [j113] [j111] [j110] [j109] [j108] [j106] [j102] [j101] [j100] [j99] [j98] [j97] [j96] [j95] [j92] [j88] [j82] [j80] [j79] [j76] [j69] [j65] [j64] [j63] [j59] [j57] [j54] [j53] [j43] [j41] [j40] [j35] [j32] [j29] [j28] [j21] [j20]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-06-17 00:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
