Ralph J. Faudree

  • University of Memphis, Department of Mathematical Sciences, TN, USA

According to our database1, Ralph J. Faudree authored at least 136 papers between 1973 and 2018.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of one.



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Degree sum and vertex dominating paths.
J. Graph Theory, 2018

A panconnectivity theorem for bipartite graphs.
Discret. Math., 2018

Minimum Degree and Dominating Paths.
J. Graph Theory, 2017

Saturation spectrum of paths and stars.
Discuss. Math. Graph Theory, 2017

Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs.
Graphs Comb., 2016

Chorded Cycles.
Graphs Comb., 2016

Locating sets of vertices on Hamiltonian cycles.
Discret. Appl. Math., 2016

Note on Locating Pairs of Vertices on Hamiltonian Cycles.
Graphs Comb., 2014

Weak saturation numbers for multiple copies.
Discret. Math., 2014

On Forbidden Pairs Implying Hamilton-Connectedness.
J. Graph Theory, 2013

Saturation Numbers for Nearly Complete Graphs.
Graphs Comb., 2013

Minimum degree and disjoint cycles in generalized claw-free graphs.
Eur. J. Comb., 2013

Weak saturation numbers for sparse graphs.
Discuss. Math. Graph Theory, 2013

Precise location of vertices on Hamiltonian cycles.
Discret. Math., 2013

A note on powers of Hamilton cycles in generalized claw-free graphs.
Discret. Math., 2013

Problems in Graph Theory from Memphis.
Proceedings of the Mathematics of Paul Erdős II, 2013

Property <i>P</i><i>d</i>, <i>m</i> and efficient design of reliable networks.
Networks, 2012

Claw-free graphs and 2-factors that separate independent vertices.
J. Graph Theory, 2012

Distributing vertices on Hamiltonian cycles.
J. Graph Theory, 2012

Locating pairs of vertices on Hamiltonian cycles.
Discret. Math., 2012

Minimum Degree and Disjoint Cycles in Claw-Free Graphs.
Comb. Probab. Comput., 2012

My Friend and Colleague, Richard Schelp.
Comb. Probab. Comput., 2012

Chvátal-Erdös type theorems.
Discuss. Math. Graph Theory, 2010

Path spectra for trees.
Discret. Math., 2010

Ramsey numbers in rainbow triangle free colorings.
Australas. J Comb., 2010

On the circumference of a graph and its complement.
Discret. Math., 2009

Pancyclic graphs and linear forests.
Discret. Math., 2009

tK<sub>p</sub>-saturated graphs of minimum size.
Discret. Math., 2009

Saturation Numbers for Trees.
Electron. J. Comb., 2009

Non-path spectrum sets.
J. Graph Theory, 2008

Forbidden subgraphs that imply 2-factors.
Discret. Math., 2008

Saturation Numbers of Books.
Electron. J. Comb., 2008

Degree conditions for hamiltonicity: Counting the number of missing edges.
Discret. Math., 2007

Cycle Extendability of Hamiltonian Interval Graphs.
SIAM J. Discret. Math., 2006

Minimal Degree and (<i>k, m</i>)-Pancyclic Ordered Graphs.
Graphs Comb., 2005

Potential forbidden triples implying hamiltonicity: for sufficiently large graphs.
Discuss. Math. Graph Theory, 2005

A note on 2-factors with two components.
Discret. Math., 2005

Generalizing Pancyclic and <i>k</i>-Ordered Graphs.
Graphs Comb., 2004

Forbidden triples implying Hamiltonicity: for all graphs.
Discuss. Math. Graph Theory, 2004

Linear forests and ordered cycles.
Discuss. Math. Graph Theory, 2004

Toughness, degrees and 2-factors.
Discret. Math., 2004

Degree conditions for <i>k</i>-ordered hamiltonian graphs.
J. Graph Theory, 2003

Two-factors each component of which contains a specified vertex.
J. Graph Theory, 2003

The Ramsey number r(C<sub>7</sub>, C<sub>7</sub>, C<sub>7</sub>).
Discuss. Math. Graph Theory, 2003

On local and global independence numbers of a graph.
Discret. Appl. Math., 2003

Analytic Graph Theory.
Proceedings of the Handbook of Graph Theory., 2003

Fragile graphs with small independent cuts.
J. Graph Theory, 2002

Forbidden subgraphs that imply hamiltonian-connectedness.
J. Graph Theory, 2002

Characterizing forbidden clawless triples implying hamiltonian graphs.
Discret. Math., 2002

Forbidden subgraphs that imply k-ordered and k-ordered hamiltonian.
Discret. Math., 2002

A note on hamiltonicity of generalized net-free graphs of large diameter.
Discret. Math., 2002

Random induced graphs.
Discret. Math., 2002

Anti-Ramsey Colorings in Several Rounds.
J. Comb. Theory, Ser. B, 2001

Survey of results on k-ordered graphs.
Discret. Math., 2001

Edge disjoint monochromatic triangles in 2-colored graphs.
Discret. Math., 2001

Weak Clique-Covering Cycles and Paths.
Ars Comb., 2001

On <i>k</i>-ordered graphs.
J. Graph Theory, 2000

Even Cycles in Graphs with Many Odd Cycles.
Graphs Comb., 2000

Vertex-Disjoint Cycles Containing Specified Edges.
Graphs Comb., 2000

Cycles in 2-Factors of Balanced Bipartite Graphs.
Graphs Comb., 2000

2-factors in claw-free graphs.
Discuss. Math. Graph Theory, 2000

3-colored Ramsey Numbers of Odd Cycles.
Electron. Notes Discret. Math., 1999

Extremal problems for forbidden pairs that imply hamiltonicity.
Discuss. Math. Graph Theory, 1999

On 2-factors in claw-free graphs.
Discret. Math., 1999

The number of cycle lengths in graphs of given minimum degree and girth.
Discret. Math., 1999

Weakly pancyclic graphs.
J. Graph Theory, 1998

Intersections of Longest Cycles in k-Connected Graphs.
J. Comb. Theory, Ser. B, 1998

The maximum number of edges in a graph with fixed edge-degree.
Discret. Math., 1998

Note on Whitney's Theorem for k-connected Graphs.
Ars Comb., 1998

Degree conditions for 2-factors.
J. Graph Theory, 1997

Characterizing forbidden pairs for hamiltonian properties.
Discret. Math., 1997

Claw-free graphs - A survey.
Discret. Math., 1997

Local connectivity and cycle xtension in claw-free graphs.
Ars Comb., 1997

An edge coloring problem for graph products.
J. Graph Theory, 1996

Endpoint extendable paths in tournaments.
J. Graph Theory, 1996

Pancyclism and small cycles in graphs.
Discuss. Math. Graph Theory, 1996

Graph spectra.
Discret. Math., 1996

Generalized degree conditions for graphs with bounded independence number.
J. Graph Theory, 1995

Degree sums, <i>k</i>-factors and hamilton cycles in graphs.
Graphs Comb., 1995

Hamiltonicity in balanced<i>k</i>-partite graphs.
Graphs Comb., 1995

Stronger bounds for generalized degress and Menger path systems.
Discuss. Math. Graph Theory, 1995

Spanning caterpllars with bounded diameter.
Discuss. Math. Graph Theory, 1995

Degree conditions and cycle extendability.
Discret. Math., 1995

Degree sequence and independence in K(4)-free graphs.
Discret. Math., 1995

On the rotation distance of graphs.
Discret. Math., 1994

A local density condition for triangles.
Discret. Math., 1994

Extremal problems and generalized degrees.
Discret. Math., 1994

Decomposition of bipartite graphs under degree constraints.
Networks, 1993

Rainbow coloring the cube.
J. Graph Theory, 1993

The complete closure of a graph.
J. Graph Theory, 1993

On graphs<i>G</i> for which all large trees are<i>G</i>-good.
Graphs Comb., 1993

A neighborhood condition which implies the existence of a complete multipartite subgraph.
Discret. Math., 1993

Ramsey Size Linear Graphs.
Comb. Probab. Comput., 1993

Networks communicating for each pairing of terminals.
Networks, 1992

Ramsey problems and their connection to tuŕan-type extremal problems.
J. Graph Theory, 1992

Complete subgraphs with large degree sums.
J. Graph Theory, 1992

Three-regular path pairable graphs.
Graphs Comb., 1992

On independent generalized degrees and independence numbers in K(1, m)-free graphs.
Discret. Math., 1992

Neighborhood unions and a generalization of Dirac's theorem.
Discret. Math., 1992

Extremal problems involving vertices and edges on odd cycles.
Discret. Math., 1992

Generalized Degrees and Menger Path Systems.
Discret. Appl. Math., 1992

Irregularity strength of dense graphs.
Discret. Math., 1991

Neighborhood conditions and edge-disjoint perfect matchings.
Discret. Math., 1991

Lower bounds for lower Ramsey numbers.
J. Graph Theory, 1990

Subgraphs of minimal degree k.
Discret. Math., 1990

Domination in colored complete graphs.
J. Graph Theory, 1989

Neighborhood unions and hamiltonian properties in graphs.
J. Comb. Theory, Ser. B, 1989

On a Neighborhood Condition Implying the Existence of Disjoint Complete Graphs.
Eur. J. Comb., 1989

Irregular networks, regular graphs and integer matrices with distinct row and column sums.
Discret. Math., 1989

Induced matchings in bipartite graphs.
Discret. Math., 1989

How to make a graph bipartite.
J. Comb. Theory, Ser. B, 1988

Small order graph-tree Ramsey numbers.
Discret. Math., 1988

Extremal theory and bipartite graph-tree Ramsey numbers.
Discret. Math., 1988

Clique partitions and clique coverings.
Discret. Math., 1988

Extremal problems involving neighborhood unions.
J. Graph Theory, 1987

Goodness of trees for generalized books.
Graphs Comb., 1987

A Ramsey problem of Harary on graphs with prescribed size.
Discret. Math., 1987

Some intersection theorems on two valued functions.
Comb., 1986

On Graphs with Ramsey-Infinite Blocks.
Eur. J. Comb., 1985

Multipartite graph - space graph Ramsey numbers.
Comb., 1985

Regular graphs and edge chromatic number.
Discret. Math., 1984

Size Ramsey numbers for small-order graphs.
J. Graph Theory, 1983

On Ramsey numbers involving starlike multipartite graphs.
J. Graph Theory, 1983

Size Ramsey numbers involving stars.
Discret. Math., 1983

On a class of degenerate extremal graph problems.
Comb., 1983

Graphs with certain families of spanning trees.
J. Comb. Theory, Ser. B, 1982

Ramsey-minimal graphs for forests.
Discret. Math., 1982

Ramsey-minimal graphs for star-forests.
Discret. Math., 1981

All triangle-graph ramsey numbers for connected graphs of order six.
J. Graph Theory, 1980

Ramsey numbers for matchings.
Discret. Math., 1980

Some connected ramsey numbers.
J. Graph Theory, 1978

On cycle - Complete graph ramsey numbers.
J. Graph Theory, 1978

Ramsey numbers for all linear forests.
Discret. Math., 1976

All Ramsey numbers for cycles in graphs.
Discret. Math., 1974

Path-cycle Ramsey numbers.
Discret. Math., 1974

Theory of path length distributions I.
Discret. Math., 1973