Ralph Faudree

Q: What Schools Are Affiliated With Ralph Faudree

Ralph Faudree is affiliated with the following schools: University of California, Berkeley, Oklahoma Baptist University, University of Memphis, Purdue University

Ralph Faudree's AcademicInfluence.com Rankings

Ralph Faudree

Mathematics

#798

World Rank

#1433

Historical Rank

#349

USA Rank

Measure Theory

#2805

World Rank

#3343

Historical Rank

#812

USA Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Ralph Faudree Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Ralph Jasper Faudree was a mathematician, a professor of mathematics and the former provost of the University of Memphis. Faudree was born in Durant, Oklahoma. He did his undergraduate studies at Oklahoma Baptist University, graduating in 1961, and received his Ph.D. in 1964 from Purdue University under the supervision of Eugene Schenkman . Faudree was an instructor at the University of California, Berkeley and an assistant professor at the University of Illinois before joining the Memphis State University faculty as an associate professor in 1971. Memphis State became renamed as the University of Memphis in 1994, and Faudree was appointed as provost in 2001.

(See a Problem?)

Ralph Faudree's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

All Ramsey numbers for cycles in graphs (1974) (217)
Claw-free graphs - A survey (1997) (207)
The size Ramsey number (1978) (201)
Characterizing forbidden pairs for hamiltonian properties (1997) (140)
A Survey of Minimum Saturated Graphs (2011) (136)
Path Ramsey numbers in multicolorings (1975) (122)
Induced matchings in bipartite graphs (1989) (122)
On a class of degenerate extremal graph problems (1983) (91)
Degree conditions for 2-factors (1997) (79)
How to make a graph bipartite (1987) (78)
Neighborhood unions and hamiltonian properties in graphs (1989) (78)
The Ramsey number r(C7, C7, C7) (2003) (73)
Irregular networks, regular graphs and integer matrices with distinct row and column sums (1989) (69)
Weakly pancyclic graphs (1998) (68)
On cycle - Complete graph ramsey numbers (1978) (60)
Path-path Ramsey-type numbers for the complete bipartite graph (1975) (55)
Path-cycle Ramsey numbers (1974) (53)
Vertex-Disjoint Cycles Containing Specified Edges (2000) (49)
A CONJECTURE OF ERDOS (1998) (46)
Some Complete Bipartite Graph - Tree Ramsey Numbers (1988) (42)
Degree conditions for k‐ordered hamiltonian graphs (2003) (39)
Ramsey numbers in rainbow triangle free colorings (2010) (38)
On the Difference between Consecutive Ramsey Numbers (1989) (36)
Survey of results on k-ordered graphs (2001) (35)
Ramsey-minimal graphs for star-forests (1981) (34)
Generalized Ramsey theory for multiple colors (1976) (34)
Ramsey-minimal graphs for forests (1982) (34)
On k-ordered graphs (2000) (34)
Forbidden Subgraphs and Pancyclicity. (1995) (31)
A note on the automorphism group of a -group (1968) (31)
Size Ramsey numbers for small-order graphs (1983) (29)
Saturation Numbers of Books (2008) (29)
Size Ramsey numbers involving stars (1983) (28)
Networks communicating for each pairing of terminals (1992) (28)
2-factors in Claw-free Graphs (1999) (27)
Forbidden subgraphs that imply 2-factors (2008) (27)
All triangle-graph ramsey numbers for connected graphs of order six (1980) (25)
A local density condition for triangles (1994) (25)
Groups in which each element commutes with its endomorphic images (1971) (25)
AN EXTREMAL PROBLEM IN GENERALIZED RAMSEY THEORY (1980) (23)
Subgraphs of minimal degree k (1990) (23)
On independent generalized degrees and independence numbers in K(1, m)-free graphs (1992) (23)
Extremal problems involving neighborhood unions (1987) (22)
Clique partitions and clique coverings (1988) (22)
Saturation Numbers for Trees (2009) (22)
Ramsey-minimal graphs for multiple copies (1978) (22)
Multipartite graph—Sparse graph Ramsey numbers (1985) (22)
Ramsey numbers for the pair sparse graph-path or cycle (1982) (22)
tKp-saturated graphs of minimum size (2009) (21)
The square of a block is strongly path connected (1976) (21)
Domination in colored complete graphs (1989) (20)
Minimal path-pairable graphs (1992) (20)
A Ramsey problem of Harary on graphs with prescribed size (1987) (19)
Cycle Extendability of Hamiltonian Interval Graphs (2006) (19)
Path pairable graphs (1999) (18)
Characterizing forbidden clawless triples implying hamiltonian graphs (2002) (18)
Distributing vertices on Hamiltonian cycles (2012) (18)
On the circumference of a graph and its complement (2009) (18)
Onk-ordered graphs (2000) (17)
Goodness of trees for generalized books (1987) (17)
Edge disjoint monochromatic triangles in 2-colored graphs (2001) (17)
Forbidden triples implying Hamiltonicity: for all graphs (2004) (16)
Generalizing Pancyclic and k-Ordered Graphs (2004) (16)
Intersections of Longest Cycles in k-Connected Graphs (1998) (16)
Subgroups of the multiplicative group of a division ring (1966) (15)
The number of cycle lengths in graphs of given minimum degree and girth (1999) (15)
Neighborhood unions and a generalization of Dirac's theorem (1992) (15)
SIZE RAMSEY NUMBERS INVOLVING MATCHINGS (1984) (14)
Forbidden subgraphs that imply hamiltonian‐connectedness * (2002) (14)
Locating pairs of vertices on Hamiltonian cycles (2012) (14)
Pancyclism and small cycles in graphs (1996) (14)
Cycles in 2-Factors of Balanced Bipartite Graphs (2000) (14)
Theory of path length distributions I (1973) (13)
Some problems in ramsey theory (1978) (13)
Irregularity strength of dense graphs (1991) (13)
Strongly regular graphs and finite Ramsey theory (1982) (13)
Three-regular path pairable graphs (1992) (13)
Note on Locating Pairs of Vertices on Hamiltonian Cycles (2014) (13)
On the rotation distance of graphs (1994) (13)
Ramsey-Minimal Graphs for Matchings (1981) (13)
Cycles in graphs without proper subgraphs of minimum degree 3 (13)
RAMSEY-MINIMAL GRAPHS FOR THE PAIR STAR , CONNECTED GRAPH (12)
Toughness, degrees and 2-factors (2004) (12)
Linear forests and ordered cycles (2004) (12)
A note on 2-factors with two components (2005) (12)
Degree conditions for k-ordered hamiltonian graphs (2003) (12)
On Forbidden Pairs Implying Hamilton‐Connectedness (2013) (12)
Path connected graphs (1974) (12)
Anti-Ramsey Colorings in Several Rounds (2001) (11)
Generalized degree conditions for graphs with bounded independence number (1995) (11)
Hamiltonicity in balancedk-partite graphs (1995) (11)
Edge-disjoint Hamiltonian cycles (1985) (10)
Extremal theory and bipartite graph-tree Ramsey numbers (1988) (10)
Rainbow coloring the cube (1993) (10)
The Ramsey number for the pair complete bipartite graph-graph of limited degree (1985) (10)
Small order graph-tree Ramsey numbers (1988) (10)
The Book-Tree Ramsey Numbers (2004) (10)
Forbidden subgraphs that imply k-ordered and k-ordered hamiltonian (2002) (10)
Extremal problems and generalized degrees (1994) (10)
Two-factors each component of which contains a specified vertex (2003) (9)
Degree sums,k-factors and hamilton cycles in graphs (1995) (9)
Precise location of vertices on Hamiltonian cycles (2013) (9)
Ramsey problems and their connection to tuŕan-type extremal problems (1992) (9)
Some intersection theorems on two-valued functions (1986) (9)
On Ramsey numbers involving starlike multipartite graphs (1983) (9)
Pancyclic graphs and linear forests (2009) (9)
Minimum Degree and Dominating Paths (2017) (9)
Ramsey numbers for all linear forests (1976) (9)
Forbidden subgraphs that imply hamiltonian-connectedness (2002) (8)
The complete closure of a graph (1993) (8)
Potential forbidden triples implying hamiltonicity: for sufficiently large graphs (2005) (8)
Two‐factors each component of which contains a specified vertex (2003) (8)
Results and Problems on Saturation Numbers for Linear Forests (2015) (8)
Weak Saturation Numbers for Sparse Graphs (2013) (7)
On the Extremal Number of Edges in 2-Factor Hamiltonian Graphs (2006) (7)
On Graphs with Ramsey-Infinite Blocks (1985) (7)
Ramsey Size Linear Graphs (1993) (7)
Extremal problems involving vertices and edges on odd cycles (1992) (7)
Local connectivity and cycle xtension in claw-free graphs (1997) (7)
Ramsey numbers for matchings (1980) (7)
A generalization of Dirac’s theorem for K(1,3)-free graphs (1992) (7)
Degree sequence and independence in K(4)-free graphs (1995) (7)
Saturation Numbers for Nearly Complete Graphs (2013) (7)
Claw‐free graphs and 2‐factors that separate independent vertices (2012) (6)
RAMSEY NUMBERS FOR BROOMS (1982) (6)
Generalized Degrees and Menger Path Systems (1992) (6)
Graph spectra (1996) (6)
Weak saturation numbers for multiple copies (2014) (6)
Ramsey Graph Theory (2013) (6)
Degree conditions for hamiltonicity: Counting the number of missing edges (2007) (6)
Saturation Spectrum of Paths and Stars (2017) (6)
Complete subgraphs with large degree sums (1992) (5)
Property Pd,m and efficient design of reliable networks (2012) (5)
Locally finite and solvable subgroups of sfields (1969) (5)
Some connected ramsey numbers (1978) (5)
Fragile graphs with small independent cuts (2002) (5)
Minimum Degree and Disjoint Cycles in Claw-Free Graphs (2012) (5)
An Extremal Result for Paths a (1989) (4)
Graphs with certain families of spanning trees (1982) (4)
Regular graphs and edge chromatic number (1984) (4)
Chorded Cycles (2016) (4)
Studies related to the Ramsey number r(K 5 -e) (1985) (4)
A Turanlike Neighborhood Condition and Cliques in Graphs (1989) (4)
Degree conditions and cycle extendability (1995) (4)
A note on hamiltonicity of generalized net-free graphs of large diameter (2002) (4)
Review: Ronald L. Graham, Bruce L. Rothschild and Joel H. Spencer, Ramsey theory (1982) (3)
Automorphism groups of finite subgroups of division rings. (1968) (3)
Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs (2016) (3)
The Entire Graph of a Bridgeless Connected Plane Graph is Panconnected (1975) (3)
Neighborhood conditions and edge-disjoint perfect matchings (1991) (3)
A panconnectivity theorem for bipartite graphs (2018) (3)
Problems in Graph Theory from Memphis (2013) (3)
On graphsG for which all large trees areG-good (1993) (3)
Non-path spectrum sets (2008) (3)
Various length paths in graphs (1978) (3)
Path spectra for trees (2010) (2)
Embedding theorems for ascending nilpotent groups (1967) (2)
Minimum degree and disjoint cycles in generalized claw-free graphs (2013) (2)
Extremal problems for forbidden pairs that imply hamiltonicity (1999) (2)
Minimal Degree and (k, m)-Pancyclic Ordered Graphs (2005) (2)
My Friend and Colleague, Richard Schelp (2012) (2)
Endpoint extendable paths in tournaments (1996) (2)
Locating sets of vertices on Hamiltonian cycles (2016) (2)
Random induced graphs (2002) (2)
Degree sum and vertex dominating paths (2018) (1)
A Collection of Results on Saturation Numbers (2014) (1)
A Conjecture of Erdős the Ramsey Number r ( W 6 ) (1996) (1)
Minimum Degree and Even Cycle Lengths (2016) (1)
Two-Irregular Graphs (1990) (1)
Stronger bounds for generalized degress and Menger path systems (1995) (1)
On Graphs Of Irregularity Strength 2 (2011) (1)
A neighborhood condition which implies the existence of a complete multipartite subgraph (1993) (1)
A Class of Size Ramsey Problems Involving Stars (2021) (1)
Extremal Problems for Degree Sequences (2004) (1)
Even Cycles in Graphs with Many Odd Cycles (2000) (1)
Combinatorics, Geometry and Probability: Ramsey Size Linear Graphs (1997) (1)
Chvátal-Erdös type theorems (2010) (1)
Neighborhood generalization unions and a of Dirac ’ s theorem (2001) (1)
Lower bounds for lower Ramsey numbers (1990) (1)
TREE-MULTIPARTITE GRAPH RAMSEY NUMBERS (1)
On a Neighborhood Condition Implying the Existence of Disjoint Complete Graphs (1989) (1)
AN EXTREMAL PROBLEM FOR COMPLETE BIPARTITE GRAPHS (1988) (1)
Regular metabelian groups of prime-power order (1970) (1)
On local and global independence numbers of a graph (2003) (1)
The maximum number of edges in a graph with fixed edge-degree (1998) (1)
Note on Whitney's Theorem for k-connected Graphs (1998) (1)
Claw-free and Generalized Bull-free Graphs of Large Diameter Are Hamiltonian Zden Ek Ryjj a Cek Katedra Matematiky Zz Apado Ceskk a Univerzita Univerzitn 22 306 14 Plze N Czech Republic (1998) (1)
3-colored Ramsey Numbers of Odd Cycles (1999) (1)
Panarboreal graphs (1980) (1)
Note on Locating Pairs of Vertices on Hamiltonian Cycles (2013) (0)
EMBEDDING THEOREMS FOR ASCENDING (2010) (0)
BIPACKING A BIPARTITE GRAPH WITH GIRTH AT LEAST 12 (2018) (0)
Richard Schelp (1936-2010) (2012) (0)
A Note on Generalized Degree (2021) (0)
A Solved and Unsolved Graph Coloring Problem (P. Erdös) (1973) (0)
Weak Clique-Covering Cycles and Paths (2001) (0)
Book Review: Ramsey theory (1982) (0)
A note on powers of Hamilton cycles in generalized claw-free graphs (2013) (0)
Decomposition of bipartite graphs under degree constraints (1993) (0)
On the diameter of graphs after vertex and edge deletion (2000) (0)
Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs (2015) (0)
A Conjecture of ErdÅ‘s (2021) (0)
EMBEDDING THEOREMS FOR ASCENDING NILPOTENT GROUPS 1 (2010) (0)
Chorded Cycles (2016) (0)
Characterizing forbidden pairs for hamiltonian properties 1 (2003) (0)
Non‐path spectrum sets (2008) (0)
SPANNING CATERPILLARS WITH BOUNDED DIAMETER (2010) (0)
Spanning caterpllars with bounded diameter (1995) (0)
Ascending Subgraph Decomposition for Forests (2021) (0)
A Conjecture of Erdős (1998) (0)
Analytic Graph Theory (2003) (0)
Even cycles in graphs with many odd (2001) (0)
A Sunvpv oF RESULTS oN THE SIZE Rentspv NuMepn (2016) (0)
Saturation Numbers for Nearly Complete Graphs (2012) (0)
An edge coloring problem for graph products (1996) (0)
X(f*G'). Let ka>-kb > * * kf and k', , kJ be the orders of (2016) (0)

This paper list is powered by the following services:

Other Resources About Ralph Faudree

en.wikipedia.org

What Schools Are Affiliated With Ralph Faudree?

Ralph Faudree is affiliated with the following schools: