The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ralph J. Faudree: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Guantao Chen, Ralph J. Faudree, Warren E. Shreve
    Weak Clique-Covering Cycles and Paths. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  2. Guantao Chen, Ralph J. Faudree, Warren E. Shreve
    Note on Whitney's Theorem for k-connected Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:49, n:, pp:- [Journal]
  3. Ralph J. Faudree, Zdenek Ryjácek, Ingo Schiermeyer
    Local connectivity and cycle xtension in claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:47, n:, pp:- [Journal]
  4. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    Multipartite graph - space graph Ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:4, pp:311-318 [Journal]
  5. Ralph J. Faudree, Miklós Simonovits
    On a class of degenerate extremal graph problems. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1983, v:3, n:1, pp:83-93 [Journal]
  6. Ralph J. Faudree, Richard H. Schelp, Vera T. Sós
    Some intersection theorems on two valued functions. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:4, pp:327-333 [Journal]
  7. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    Ramsey Size Linear Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:389-399 [Journal]
  8. Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak
    Generalized Degrees and Menger Path Systems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:37, n:, pp:179-191 [Journal]
  9. Ralph J. Faudree, Zdenek Ryjácek, Richard H. Schelp
    On local and global independence numbers of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:79-84 [Journal]
  10. Béla Bollobás, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    Random induced graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:248, n:1-3, pp:249-254 [Journal]
  11. Jan Brousek, Ralph J. Faudree, Zdenek Ryjácek
    A note on hamiltonicity of generalized net-free graphs of large diameter. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:251, n:1-3, pp:77-85 [Journal]
  12. Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel
    Edge disjoint monochromatic triangles in 2-colored graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:231, n:1-3, pp:135-141 [Journal]
  13. Ralph J. Faudree
    Survey of results on k-ordered graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:229, n:1-3, pp:73-87 [Journal]
  14. Jill R. Faudree, Ralph J. Faudree
    Forbidden subgraphs that imply k-ordered and k-ordered hamiltonian. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:243, n:1-3, pp:91-108 [Journal]
  15. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
    Characterizing forbidden clawless triples implying hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:249, n:1-3, pp:71-81 [Journal]
  16. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito
    Toughness, degrees and 2-factors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:286, n:3, pp:245-249 [Journal]
  17. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito
    A note on 2-factors with two components. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:300, n:1-3, pp:218-224 [Journal]
  18. Ralph J. Faudree, Richard H. Schelp, Akira Saito, Ingo Schiermeyer
    Degree conditions for hamiltonicity: Counting the number of missing edges. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:873-877 [Journal]
  19. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
    Generalizing Pancyclic and k-Ordered Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:3, pp:291-309 [Journal]
  20. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
    Minimal Degree and (k, m)-Pancyclic Ordered Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:2, pp:197-211 [Journal]
  21. Aart Blokhuis, Ralph J. Faudree, András Gyárfás, Miklós Ruszinkó
    Anti-Ramsey Colorings in Several Rounds. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:82, n:1, pp:1-18 [Journal]
  22. Guantao Chen, Ralph J. Faudree, Ronald J. Gould
    Intersections of Longest Cycles in k-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:72, n:1, pp:143-149 [Journal]
  23. Paul Erdös, Ralph J. Faudree, János Pach, Joel H. Spencer
    How to make a graph bipartite. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:1, pp:86-98 [Journal]
  24. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    Graphs with certain families of spanning trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1982, v:32, n:2, pp:162-170 [Journal]
  25. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp
    Neighborhood unions and hamiltonian properties in graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:47, n:1, pp:1-9 [Journal]
  26. Ralph J. Faudree, Richard H. Schelp, J. Sheehan
    Ramsey numbers for matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1980, v:32, n:2, pp:105-123 [Journal]
  27. Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    Ramsey-minimal graphs for star-forests. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:33, n:3, pp:227-237 [Journal]
  28. Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    Ramsey-minimal graphs for forests. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:1, pp:23-32 [Journal]
  29. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    A Ramsey problem of Harary on graphs with prescribed size. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:67, n:3, pp:227-233 [Journal]
  30. Ralph J. Faudree, J. Sheehan
    Size Ramsey numbers involving stars. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:46, n:2, pp:151-157 [Journal]
  31. Ralph J. Faudree, J. Sheehan
    Regular graphs and edge chromatic number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:48, n:2-3, pp:197-204 [Journal]
  32. Paul Erdös, Ralph J. Faudree, Edward T. Ordman
    Clique partitions and clique coverings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:93-101 [Journal]
  33. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    Extremal theory and bipartite graph-tree Ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:103-112 [Journal]
  34. Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    Small order graph-tree Ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:119-127 [Journal]
  35. Ralph J. Faudree, Richard H. Schelp, Michael S. Jacobson, Jenö Lehel
    Irregular networks, regular graphs and integer matrices with distinct row and column sums. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:76, n:3, pp:223-240 [Journal]
  36. Ralph J. Faudree, András Gyárfás, Richard H. Schelp, Zsolt Tuza
    Induced matchings in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:78, n:1-2, pp:83-87 [Journal]
  37. Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li, Zhenhong Liu
    On 2-factors in claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:206, n:1-3, pp:131-137 [Journal]
  38. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:55-60 [Journal]
  39. Ralph J. Faudree, J. Sheehan
    The maximum number of edges in a graph with fixed edge-degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:183, n:1-3, pp:81-101 [Journal]
  40. Ralph J. Faudree, Ronald J. Gould
    Characterizing forbidden pairs for hamiltonian properties. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:173, n:1-3, pp:45-60 [Journal]
  41. Ralph J. Faudree, Evelyne Flandrin, Zdenek Ryjácek
    Claw-free graphs - A survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:87-147 [Journal]
  42. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    Subgraphs of minimal degree k. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:1, pp:53-58 [Journal]
  43. Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak
    Neighborhood conditions and edge-disjoint perfect matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:91, n:1, pp:33-43 [Journal]
  44. Ralph J. Faudree, Michael S. Jacobson, Lael F. Kinch, Jenö Lehel
    Irregularity strength of dense graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:91, n:1, pp:45-59 [Journal]
  45. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau
    Extremal problems involving vertices and edges on odd cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:23-31 [Journal]
  46. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:103, n:1, pp:17-24 [Journal]
  47. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
    Neighborhood unions and a generalization of Dirac's theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:105, n:1-3, pp:61-71 [Journal]
  48. Ralph J. Faudree, Debra J. Knisley
    A neighborhood condition which implies the existence of a complete multipartite subgraph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:118, n:1-3, pp:57-68 [Journal]
  49. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
    Degree conditions and cycle extendability. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:109-122 [Journal]
  50. Paul Erdös, Ralph J. Faudree, Talmage James Reid, Richard H. Schelp, William Staton
    Degree sequence and independence in K(4)-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:285-290 [Journal]
  51. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak
    Graph spectra. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:103-113 [Journal]
  52. Ralph J. Faudree, Richard H. Schelp, Linda M. Lesniak, András Gyárfás, Jenö Lehel
    On the rotation distance of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:126, n:1-3, pp:121-135 [Journal]
  53. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau
    Extremal problems and generalized degrees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:127, n:1-3, pp:139-152 [Journal]
  54. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    A local density condition for triangles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:127, n:1-3, pp:153-161 [Journal]

  55. Forbidden subgraphs that imply 2-factors. [Citation Graph (, )][DBLP]


  56. On the circumference of a graph and its complement. [Citation Graph (, )][DBLP]


  57. Pancyclic graphs and linear forests. [Citation Graph (, )][DBLP]


  58. tKp-saturated graphs of minimum size. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002