Books Published

Proceedings of a Conference on Combinatorics, Memphis State Univ., 1972 (editors: R. J. Faudree, C. C. Rousseau, and R.H.Schelp)  

Book Reviews

R. J. Faudree, Ramsey Theory by R. L. Graham, B. L. Rothschild, and J. H. Spencer, Proc. Amer. Math. Soc, 1981,

R. J. Faudree, Extremal Paths in Graphs by Ulrich Huckenbeck, Zentralblatt, 1987

R. J. Faudree, Erdos on Graphs by R. L. Graham and Fan Chung, Zentralblatt, 1998

R. J. Faudree, Modern Graph Theory by B. Bollobas, Zentralblatt, 1999

Refereed Journal Publications

[1] R. J. Faudree, Subgroups of the Multiplicative Group of a Division Ring, Proc. Amer. Math. Soc. 124 (1966), 41-48.

[2] R. J. Faudree, Embedding Theorems for Ascending Nilpotent Groups, Proc. Amer. Math. Soc. 18 (1967), 148-154.

[3] R. J. Faudree, Automorphism Groups of Finite Subgroups of Division Rings, Pacific J. Math. 26 (1968), 59-65.

[4] R. J. Faudree, A Note on the Automorphism Group of a p-Group, Proc. Amer. Math. Soc. 19 (1968), 1379-1382.

[5] R. J. Faudree, Locally Finite and Solvable Subgroups of Sfields, Proc. Amer. Math. Soc. 22 (1969), 407-413.

[6] R. J. Faudree, Regular Metabelian Groups of Prime-Power Order, Bull. Austral. Math. Soc. 3 (1970), 49-54.  

[7] R. J. Faudree, Groups in which each Element Commutes with its Endomorphic Images, Proc. Amer. Math. Soc. 27 (1971), 236-250.  

[8] R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Theory of Path Length Distribution I, Discrete Math. 6 (1973), 35-52.

[9] R. J. Faudree and R. H. Schelp, A Solved and Unsolved Graph Coloring Problem, SIAM Review 15 (1973), 377-380.

[10] R. J. Faudree and R. H. Schelp, Ramsey Type Results, Colloquia Math. Soc. Janos Bolyai 10 (1973), 657-665.

[11] R. J. Faudree and R. H. Schelp, Path Connected Graphs, Acta Mathematica Scientiarum Hungaricae 25 (1974), 313-319.

[12] R. J. Faudree and R. H. Schelp, All Ramsey Numbers for Cycles in Graphs, Discrete Math. 8 (1974), 313-329.

[13] R. J.Faudree, S. L. Lawrence, T. D. Parsons, and R. H. Schelp, Path-Cycle Ramsey Numbers, Discrete Math. 19 (1974), 313-329.)

[14] R. J. Faudree and R. H. Schelp Path-Path Ramsey Type Numbers for the Complete Bipartite Graph, J. of Comb. Theory B 19 (1975), 150-160.   

[15] R. J. Faudree and R. H. Schelp, Path Ramsey Numbers in Multicolorings, J. of Comb. Theory B 19 (1975), 161-173.  

[16] R. J. Faudree and R. H. Schelp, The Entire Graph of a Bridgeless Connected Plane Graph is Panconnected, J. of Lond. Math. Soc. 12 (1975), 59-66.

[17] R. J. Faudree and R. H.Schelp, The Square of a Block is Strongly Path Connected, J. of Comb. Theory B 20 (1976), 47-61.

[18] P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp Generalized Ramsey Theory for Multiple Colors, J. of Comb. Theory B 20 (1976), 250-264.

[19] R. J. Faudree and R. H. Schelp, Ramsey Numbers for all Linear Forests, Discrete Math. 16 (1976), 149-155.

[20] R. J. Faudree and R. H. Schelp, Connected Ramsey Numbers for Paths and Stars, Colloquia Math. Soc. Janos Bolyai 18 (1976), 307-313.

[21] P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Cycle-Complete Graph Ramsey Numbers, J. of Graph Theory 2 (1978), 53-64.

[22] P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, The Size Ramsey Number, A New Concept in Generalized Ramsey Theory, Periodica Mathematica Hungarica 9 (1978), 145-161.

[23] R. J. Faudree and R. H. Schelp, Some Connected Ramsey Numbers, J. of Graph Theory 2 (1978), 119-128.

[24] R. J. Faudree and R. H. Schelp, Some Problems in Ramsey Theory, Springer-Verlag Lecture Series 642 (1978), 500-515.

[25] R. J. Faudree and R. H. Schelp, Various Lengths Paths in Graphs, Springer-Verlag Lecture Series 642 (1978), 160-173.

[26] S. A. Burr, P. Erdos, R. J. Faudree C. C. Rousseau, and R. H. Schelp, Ramsey Minimal Graphs for Multiple Copies, Proc.

[27] R. J. Faudree, C. C. Rousseau, R. H. Schelp and S. Schuster, Panaboreal Graphs, Israel J. of Math. 135(3), (1980), 177-185.

[28] R. J. Faudree, J. Sheehan and R. H. Schelp, Ramsey Numbers for Matchings, Discrete Math. 32 (1980), 105-123.

[29] S. A. Burr, P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, An Extremal Problem in Generalized Ramsey Theory, Ars. Combinatoria 10 (1980), 193-203.

[30] R. J. Faudree, C. C. Rousseau and R. H. Schelp, All Triangle-Graph Ramsey Numbers for Connected Graphs of Order Six, J. of Graph Theory 4 (1980), 293-300.

[31] S. A. Burr, P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Ramsey Minimal Graphs for the Pair Star - Connected Connected Graphs, Studia Scient. Math. Hungar. 15 (1980), 265-273.

[32] R. J. Faudree, C. C. Rousseau, R. H. Schelp and S. Schuster, Embedding Graphs in Their Complements, Czech. Math. J. 31(106) (1981), 53-62.

[33] S. A. Burr, P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Ramsey Minimal Graphs for Star Forests, Discrete Math. 33 (1981), 227-237.

[34] R. J. Faudree, R. Haggkyist and R. H. Schelp, Pancyclic Graphs -- Connected Ramsey Number, Ars. Combinatoria (1981), 37-49.

[35] R. J. Faudree, C. C. Rousseau and R. H. Schelp, Generalizations of a Ramsey Result of Chvatal, The Theory and Applications of Graphs, G. Chartrand, editor, John Wiley (1981), 351-362.

[36] S. A. Burr, P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Ramsey Minimal Graphs for Matchings, The Theory and Applications of Graphs, G. Chartrand, editor, John Wiley (1981) 159-168.

[37] R. J. Faudree and P. Erdos, Size Ramsey Numbers Involving Matchings, Colloquia Mathematica Societatis Janos Bolyai 37 (1981), 247-264.

[38] S. A. Burr, P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Ramsey Minimal Graphs for Forests, Discrete Math. 38 (1982), 23-32.

[39] S. A. Burr, P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Ramsey Numbers for the Pair Sparse Graph-Path or Cycle, Trans. Amer. Math. Soc. 2 (269) (1982), 501-512.

[40] P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Graphs Containing Certain Spanning Trees, J. of Comb. Theory B, 32 (1982), 162-170

[41] R. J. Faudree, C. C. Rousseau and J. Sheehan, Strongly Regular Graphs and Finite Ramsey Theory, Linear Algebra and its Applications 46 (1982), 221-241

[42] R. Faudree and J. Sheehan, Size Ramsey Numbers Involving Stars, Discrete Math.46 (1983), 151-157.)

[43] R. Faudree and J. Sheehan, Size Ramsey Numbers for Small Order Graphs, J. of Graph Theory 7, (1983), 53-56.

[44] S. A. Burr, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, On Ramsey Numbers Involving Starlike Multipartite Graphs, J. Graph Theory 7, (1983), 395-409.

[45] R. J. Faudree and Miklos Simonovits, On a Class of Degenerate Extremal Graph Problems, Combinatorica 3 (1983), 83-94.

[46] R. J. Faudree and J. Sheehan, Regular Graphs and Edge Chromatic Number, Discrete Math. 48 (1984), 197-204.

[47] P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Tree - Multipartite Graph Ramsey Numbers, GraphTheory and Combinatorics - A Volume in Honor of Paul Erdos, Bela Bollobas, editor, Academic Press, (1984),155-160.

[48] R. J. Faudree, C. C. Rousseau and J. Sheehan, A Class of size Ramsey Numbers Involving Stars, GraphTheory and Combinatorics - A Volume in Honor of Paul ErdHos, BelaBollobas, editor, Academic Press, (1984), 273-282.

[49] R. J Faudree, C. C. Rousseau and R. H Schelp, Edge Disjoint Hamiltonian Cycles, Graph Theory with Applications to Algorithms and Computer Sciences, G.Chartrand, ed. Wiley- Interscience, New York, (1985),231-249.

[50] S. A. Burr, P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, The Ramsey Number for the Pair Complete Bipartite Graph -Graph with Limited Degree, Graph Theory with Applications to Algorithms and Computer Sciences G. Chartrand, ed. Wiley- Interscience, New York, (1985), 163-174.

[51] R. J. Faudree, C. C. Rousseau and R. H. Schelp, Studies related to $r(K_5 - e)$, Graph Theory with Applications to Algorithms and Computer Sciences G. Chartrand, ed. Wiley-Interscience, New York, (1985), 251-271.

[52] P. Erdos, R. J. Faudree, C. C. Rousseau and R. H. Schelp, Multipartite Graph -- Sparse Graph Ramsey Numbers, Combinatorica 5, (1985), 311-318.

[53] S. A. Burr, R. J. Faudree, and R. H. Schelp, On Graphs with Ramsey-Infinite Blocks, European J. of Comb. 6 (1985), 129-132.

[54] R. J. Faudree, R. H. Schelp and V. T. Sos, Intersection Theorems on Two-Valued Functions, Combinatorica 6, (1986), 327-333.

[55] S. A. Burr, P. Erdos, R. J. Faudree, R. Gould, M. Jacobson, C. C. Rousseau and R. H. Schelp, Goodness of Trees for Generalized Books, Graphs and Combinatorics 3 (1987), 1-6.

[56] R. J. Faudree, Graph Theory, Encyclopedia of the Physical Sciences and Technology (6), (1987), Academic Press, 308-325.

[57] P. Erdos, C. C. Rousseau, and R. H. Schelp, A Ramsey Problem of Harary on Graphs with Prescribed Size, Discrete Math. 67 (1987), 227-234.

[58] R. J. Faudree, R. Gould, M. Jacobson, C. C. Rousseau, and R. H. Schelp, Extremal Problems Involving Neighborhood Unions, J. of Graph Theory 11 (1987), 555-564.

[59] R. J. Faudree, M. S. Jacobson, R. H. Schelp, and Zs. Tuza, Menger's Theorem and Short Paths, J. Combin. and Math.Combin. Comp. 2 (1987), 235-253..

[60] P. Erdos, R. J. Faudree, A. Gyarfas, and R. H. Schelp, Cycles in Graphs without proper subgraphs of minimal degree3, Ars. Combinatoria 25B (1988), 195-202.

[61] R. F. Faudree, R. J. Gould and R. H. Schelp, Neighborhood Condition and Edge Disjoint Hamiltonian Cycles in Graphs, Congressus Numerantium 59 (1987), 55-68.

[62] R. J. Faudree, Graphs Which have an Ascending Chain Subgraph Decomposition, Congressus Numerantium 59 (1987), 49-54.

[63] P. Erdos, R. J. Faudree, J. Pach and J. Spencer, How to make a Graph Bipartite, J. Comb. Theory B 45 (1988), 86-98. (with

[64] P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Small Order Graphs -- Tree Ramsey Numbers, Discrete Math. 72 (1988), 119-128.

[65] P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Extremal Theory and Bipartite Graph -- Tree Ramsey Numbers, Discrete Math. 72 (1988), 103-112.

[66] S. A. Burr, P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Some Complete Bipartite Graph -- Tree Ramsey Numbers, Annals of Discrete Math. 41 (1988), 79-90.

[67] P. Erdos, R. J. Faudree, and E. Ordman, Clique Partitions and Clique Coverings, Discrete Math. 72 (1988), 93-101.

[68] P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Book -- Tree Ramsey Numbers, Scientia, A: Mathematics 1 (1988), 111-117.

[69] R. J. Faudree, R. J. Gould, M. S. Jacobson, and L. Lesniak, Graphs with an Ascending Subgraph Decomposition, Congressus Numerantium 65 (1988), 33-42. .

[70] P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, On the Extremal Problems for Complete Bipartite Graphs, Studia Mathematica Hungar. 23 (1988), 319-326.

[71] R. J. Faudree, R. J. Gould, M. S. Jacobson, and L. Lesniak, Neighborhood Closures for Graphs, Colloquia Mathematica Societatis Janos Bolyai 52 (1989), 227-237.

[72] S. A. Burr, P. Erdos, R. J. Faudree, A. Gyarfas, and R. H. Schelp, Extremal Problems for Degree Sequences, Colloquia Mathematica Societatis Janos Bolyai 52 (1989), 183-193.

[73] R. J. Faudree and J. Lehel, Bounds on the Irregularity Strength of Regular Graphs, Colloquia Mathematica Societatis Janos Bolyai 52 (1989), 247-256.

[74] R. J. Faudree, A. Gyarfas, and R. H. Schelp, On Graphs of Irregularity Strength 2, Colloquia Mathematica Societatis Janos Bolyai 52 (1989), 240-246.

[75] R. J. Faudree, Z. Furedi, and N. Alon, A Turan-like Neighborhood Condition and Cliques in Graphs, Annals New York Acad. Sci. 555, Combin. Math.: Proc.Third Inter. Conf., (1989), 4-8.

[76] S. A. Burr, P. Erdos, R. J. Faudree, and R. H. Schelp, The Difference Between Consecutive Classical Ramsey Numbers, Utilitas Math. 35 (1989), 115-118.

[77] R. J. Faudree, R. J. Gould, M. S. Jacobson, and R. H. Schelp, Neighborhood Unions and Hamiltonian Properties in Graphs, J. Comb. Theory B 47 (1989), 1-9.

[78] R. J. Faudree, M. S. Jacobson, J. Lehel, and R. H. Schelp, Irregular Networks, Regular Graphs and Integer Matrices with Distinct Row and Column Sums, Discrete Math. 76 (1989), 223-240.

[79] R. J. Faudree, R. J. Gould, M. S. Jacobson, and L. Lesniak, Disjoint Complete Graphs, European J. of On a Neighborhood Condition Implying the Existence of Combinatorics 10 (1989), 427-433.

[80] R. J. Faudree, A. Gyarfas, R. H. Schelp, and Zs. Tuza, Induced Matchings in Bipartite Graphs, Discrete Math. 78 (1989), 83-87.

[81] P. Erdos, R. J. Faudree, A. Gyarfas, and R. H. Schelp, Domination in Colored Complete Graphs, J. Graph Theory 13 (1989), 713-718

[82] R. J. Faudree, R. J. Gould, and R. H. Schelp, Menger Path Systems, J. Comb. Math. And Comb. Comp 6 (1989), 9-21.

[83] R. J. Faudree and F. Harary, The Zero-Sum Property for Finite Groups, J. Combin. Information and Systems Sci. 14 (1989), 5-12.

[84] R. J. Faudree, R. H. Schelp, and M. Simonovits, On Some Ramsey Type Problems Connected with Paths, Cycles and Trees, Arts Combinatoria 29 (1990), 97-106.

[85] R. J. Faudree and R. J. Gould, Ascending Subgraph Decomposition for Forests, Congressus Numerantium 70 (1990), 221-229

[86] P. Erdos, R. J. Faudree, R. J. Gould, A. Gyarfas, C. C. Rousseau, and R. H. Schelp, Monochromatic Coverings in Colored Complete Graphs, Congressus Numerantium 71 (1990), 29-38.

[87] R. J. Faudree, A. Gyarfas, R. H. Schelp, and Zs. Tuza, The Strong Chromatic Index of Graphs, Ars. Combinatoria 29, (1990), 205-211.

[88] P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp Subgraphs of Minimal Degree k, Discrete Math. 85, (1990), 53-58.

[89] R. J. Faudree, R. J. Gould, M. S. Jacobson, and L. Lesniak, Lower Bounds for Lower Ramsey Numbers, J. Graph Theory, 14 (1990), 723-730.

[90] R. J. Faudree, R. H. Schelp, and W. Shreve, Domination Number for the Product of Graphs, Congressus Numerantium 79, (1990), 29-33.

[91] P. K. Card, R. J. Faudree, and C. M. Wong, Extremal Problems on the Diameter of Deleted Graphs, Congress. Numer. 79, (1990), 41-54.

[92] R. J. Faudree, R. J. Gould, M. S. Jacobson, and R. H. Schelp, Two-Irregular Graphs, Topics in Combinatorics and Graph Theory, (1990), Physica - Verlag, Heidelberg, 239-248.

[93] R. J. Faudree, R. J. Gould, M. S. Jacobson, and L. Lesniak, Neighborhood Unions and Highly Hamiltonian Graphs, Ars. Combinatoria 31 (1991), 139-148.

[94] R. J. Faudree, Ramsey Minimal Graphs for Star Forests, Ars Combinatoria 31 (1991), 117-124.

[95] R. J. Faudree, R. J. Gould, M. S. Jacboson, and L. Lesniak, Generalized Degrees, Connectivity, and Hamiltonian Properties in Graphs, J. Combin. Computing and Information and Sci. 16 (1991), 93-105.

[96] R. J. Faudree, C. C. Rousseau, and J. Sheehan, Cycle - Book Ramsey Numbers, Ars. Combinatoria 31 (1991), 239-248

[97] R. J. Faudree, R. J. Gould, and L. Lesniak, Neighborhood Conditions and Edge Disjoint Perfect Matchings, Discrete Math. 91 (1991), 33-44.

[98] R. J. Faudree, M. S. Jacobson, L. Kinch, and J. Lehel, Irregularity Strength of Dense Graphs, Discrete Math. 91 (1991), 45-59.

[99] R. J. Faudree, R. J. Gould, M. Jacobson, and R. H. Schelp, Seymour's Conjecture, Advances in Graph Theory ed. By Krulli, Vishwa Int. Pub. (1991). 163-171.

[100] R. J. Faudree, R. Gould, M. Jacobson, L. Lesniak, and T. Lindquester, A Generalization of Dirac's Theorem for $K_1,3$-Free Graphs, Periodica Mathematica Hungarica 24, (1992), 35-50.

[101] R. J. Faudree, R. J. Gould, and L. Lesniak, Generalized Degrees and Menger Path Systems, Applied Discrete Math. 37-38, (1992), 179-191.

[102] R. J. Faudree and M. Simonovits, Ramsey Problems and Their Connection to Tur'an Type Extremal Problems, J. Graph Theory 16 (1992), 25-50.

[103] R. J. Faudree, R. J. Gould, M. S. Jacboson, and L. Lesniak, Neighborhoood Unions and a Generalization of Dirac's Theorem, Discrete Math. 105, (1992), 61-71.

[104] R. J. Faudree, A. Gyarfas, and J. Lehel, Three-Regular Path Pairable Graphs, Graphs and Combinatorics 8, (1992), 45-52.

[105] R. J. Faudree, Properties in Pairable Graphs, New Zealand Journal of Mathematics 21, (1992), 91-106.

[106] R. J. Faudree, R. Gould, M. Jacobson, and L. Lesniak, On the Ascending Subgraph Decomposition Problem, Utilitas Mathematica 41, (1992), 33-40.

[107] R. J. Faudree, Complete Subgraphs with Large Degree Sums, J. Graph Theory 16 (1992), 327-334.

[108] R. J. Faudree, R. Gould, M. Jacobson, L. Lesniak, and T. Lindquester, On Independent Generalized Degree and Independence Number in $K(1,m)$ - Free Graphs, Discrete Math 103 (1992), 17-24 .

[109] L. Csaba, R. J. Faudree, A. Gyarfas, J. Lehel, and R. H. Schelp, Networks Communicating for Each Pairing of Terminals, Networks 22 (1992), 615-626.

[110] P. Erdos, R. J. Faudree, and C. C. Rousseau, Extremal Problems Involving Vertices and Edges on OddCycles in Graphs, Discrete Math. 101, (1992), 23-31.

[111] P. Erdos and R. J. Faudree, Size Ramsey Functions, Colloquia Mathematica Societatis J'anos Bolyai, 60, (1992) it Proc. of Sets, Graphs, and Numbers, Budapest, Hungary, (1991), 219-238.

[112] R. J. Faudree, A. Gyarfas, and T. SzHoyni, Projective Spaces and Colorings of $K_m times K_n$, Colloquia Mathematica Societatis J'anos Bolyai, 60, (1992) it Proc. of Sets, Graphs, and Numbers, Budapest, Hungary, (1991), 273-278.

[113] R. J. Faudree, Graph Theory, (Revised), Encyclopedia of the Physical Sciences and Technology, (7), (1992), Academic Press, 473-490.

[114] Brosema, R. J. Faudree, J. van den Hueval, and H. J. Veldman, Decomposition of Bipartite Graphs Under Degree Constraints, Networks 23, (1993), 159-164.

[115] R. J Faudree, Some Variations on Connectivity, Combinatorics, Paul Erdos is Eighty, (eds. Mikl'os, S'os, and SzHonyi), Bolyai Soc. Math. Stud. 1, (1993), 125-144.

[116] R. J. Faudree, E. Flandrin, O. Favaron, and H. Li, The Complete Closure of a Graph, J. Graph Theory 17, (1993), 481-494.

[117] R. J. Faudree and B. McKay, A Conjecture of ErdHos and the Ramsey Number $r(W_6)$, J. Combin. Math. Combin. Comp. 13 (1993), 23-31.

[118] R. J Faudree, A. Gyarfas, L. Lesniak, and R. H. Schelp, Rainbow Colorings of the Cube, J. Graph Theory 17, (1993), 607-612.

[119] R. J. Faudree and Debra J. Knisley, A Neighborhood condition Which Implies the Existence of a Complete Multipartite Subgraph, Discrete Math. 118 (1993), 57-68.

[120] S. A. Burr and R. J. Faudree, On Graphs G for which all trees are G-good, Graphs and Combinatorics 9 (1993), 305-315.

[121] P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Ramsey Size Linear Graphs, Combinatorics, Probability, and Computing 2, (1993), 389-399.

[122] R. J. Faudree, A. Gyarfas, J. Lehel, L. Lesniak, and R. H. Schelp, On the Rotation Distance of Graphs, Discrete Math. 126 (1994), 121-135.

[123] P. Erdos, R. J. Faudree, and R. H. Schelp, A Local Density Condition for Triangles, Discrete Math. 127 (1994), 153-161.

[124] P. Erdos, R. J. Faudree, and C. C. Rousseau, Extremal Problems and Generalized Degrees, Discrete Math, 127 (1994), 139-152.

[125] R. J. Faudree, R. H. Schelp, and W. Shreve, A Note on Generalized Degree, Congressus Numerantium, 99, (1994), 43-48.

[126] R. J. Faudree, A. Gyarfas, and J. Lehel, Minimal Path Pairable Graphs, Congressus Numerantum, 88, (1994), 111-128.

[127] P. Erdos, V. T. Sos, and R. J. Faudree, The $k$-Spectrum of a Graph, Proceedings of the Seventh International Conference on Graph Theory, Combinatorics, Algorithms, and Applications, Kalamazoo, Michigan, John Wiley and Sons Inc., (1995), 377-389.

[128] R. J. Faudree and Jan van den Heuval, Degree Sums, $k$-Factors and Hamiltonian Cycles in Graphs, Graphs and Combinatorics 11, (1995), 21-28.

[129] R. J. Faudree, R. J. Gould, L. M. Lesniak, and T. Lindquester, Generalized Degree Conditions for Graphs with Bounded Independence Number, J. Graph Theory 19, (1995), 397-409.

[130] R. J. Faudree, R. J. Gould, L. Lesniak, and M. S. Jacobson, Degree Conditions and Cycle Extendability, Discrete Math. 141, (1995), 109-122.

[131] P. Erdos, R. J. Faudree, T. J. Reid, R. H. Schelp, and W. Station, Degree Sequence and Independence in $K_4$-Free Graphs, Discrete Math. 141, (1995), 285-290.

[132] P. Erdos, R. J. Faudree, E. Gyhon, On the Book Size of Graphs of Large Minimum Degree, Studia Scientiarum Mathematicarum Hungarica 30, (1995), 25-46.

[133] R. J. Faudree, I. Schiemeyer, and Z. Ryajycek, Forbidden Subgraphs and Cycle Extendability, J. Comb. Math. Comb. Comp. 19, (1995), 109-128.

[134] G. Chen, R. J. Faudree, R. J. Gould, M. S. Jacobson, and L. M. Lesniak, Hamiltonicity in Balanced $k$-Partite Graphs, Graphs and Combinatorics. 11, (1995), 221-231.

[135] R. J. Faudree and Z. Tuza, Stronger Bounds for Generalized Degrees and Menger Path Systems, Discussiones Mathematicae - Graph Theory, 15 (1995), 167-177.

[136] R. J. Faudree, R. J. Gould, M. S. Jacobson, and L. Lesniak, Spanning Caterpillars with Bounded Diameter, Discussiones Mathematicae - Graph Theory, 15 (1995), 111-118.

[137] R. J. Faudree, R. J. Gould, Z. Ryajycek, and I. Schriermeyer, Forbidden Subgraphs and Pancyclicity, Congressus Numerantium 109, (1995), 13-32.

[138] R. J. Faudree, R. J. Gould, M. Jacobson, J. Lehel, and L. Lesniak, Graph Spectra, Discrete Math. 150 (1996), 103-113.

[139] R. J. Faudree, E. Flandrin, O. Favaron, and H. Li, Pancyclism and Small Cycles in Graphs, Discussiones Mathematicae - Graph Theory 16 (1996), 27-40.

[140] R. J. Faudree, A. Gyarfas and R. H. Schelp, An Edge Coloring Problem for Graph Products, J. Graph Theory 23, (1996), 297-302.

[141] R. J. Faudree and A. Gyarafas, Endpoint Extendable Paths in Tournaments, J. Graph Theory 23, (1996), 303-307.

[142] R. J. Faudree, Forbidden Graphs and Hamiltonian Properties - A Survey, Congressus Numerantium 116 (1996), 33-52.

[143] P. Erdos, R. J. Faudree, A. Jagota, and T. Luczak, Large Subgraphs of Minimal Density or Degree, J. Comb. Math. Comb. Comp. 22 (1996), 87-96.

[144] R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Problems in Graph Theory from Memphis, Mathematics of Paul Erdos Vol. II, (eds. R. L. Graham and J. Nevsetvril, Springer Verlag, (1996), 7-26.

[145] R. J. Faudree, H. Harborth, and I. Mengersen, Ramsey Numbers of Graph Sets Versus Complete Graphs, Utilitas Mathematica 50, (1996), 85-95.

[146] R. J. Faudree and A. Gyarafas, Path Matchings in Graphs, Congressus Numerantium 120. (1996), 83-97.

[147] R. J. Faudree and D. Knisley, The Characterization of Large (2,R)-Regular Graphs, Congressus Numerantium 121, (1996), 105-108,

[148] A. Burris and R J. Faudree, The Path Length Sequence of Km,n and Other Triangle Free Graphs, Congressus Numerantium 118, (1996), 117-126.

[149] S. Brandt, G. Chen, R. J. Faudree, R. J. Gould, and L. Lesniak, Degree Conditions for 2-factors, J. Graph Theory 24 (1997), 165-173.

[150] R. J. Faudree, E. Flandrin and Z. Ryj'avcek, Claw-Free Graphs - A Survey, Discrete Math 164, (1997), 87-147.  

[151] R. J. Faudree and R. J. Gould, Characterizing Forbidden Pairs for Hamiltonian Pairs, Discrete Math. 173, (1997), 45-60.  

[152] R. J. Faudree, Z. Ryj'avcek and I. Schiermeyer, Local Connectivity and Cycle Extendability, Ars Combinatoria, 47, (1997), 185-190.

 [153]  P. ErdH{o}s, R. J. Faudree, C. C. Rousseau, and R. H. Schelp,   Ramsey Size Linear Graphs,  Combinatorics, Geometry and Probability (Cambridge, (1993), Cambridge Univ. Press, (1997), 241-251.     

[154] S. Brandt R. J. Faudree, and W. Goddard, Weakly Pancyclic Graphs, J. Graph Theory 27, (1998), 141-176.  

[155] G. Chen, R. J. Faudree, and R. J. Gould, Intersections of Longest Cycles in k-Connected Graphs, J. Comb. Theory B 72, (1998), 143-149..  

[156] R. J. Faudree, A Conjecture of Erdos, Amer. Math. Monthly 105, 451-453.  

[157] R. J. Faudree, O. Favaron and H. Li, Independence, Domination, Irreduncance, and Forbidden Pairs, J. Comb. Math. Com. Comp. 26, (1998), 193-212.  

[158] R. J. Faudree and J. Sheehan, The Maximum Number of Edges in a Graph with Fixed Edge Degree, Discrete Math. 183, (1998), 81-101.  

[159] G. Chen, R. J. Faudree and W. E. Shreve, A Note on Whitney's Theorem for 3-connected Graphs, Ars Combinatoria 49, (1998), 33-40.  

[160] R. J. Faudree and Paul Erdos, Restricted Size Ramsey Number for Cycles and Stars, Discrete Math. ( Proceeding of the Eighth International Conference on Graph Theory, Combinatorics, Algorithms and Applications) , (1998), 353-367.  

[161] R. J. Faudree, R. J. Gould, and T. Lindquester, On k-Linked Graphs, Discrete Math. (Proceeding of the Eighth International Conference on Graph Theory, Combinatorics, Algorithms and Applications.), (1998), 387-400.  

[162] R. J. Faudree, Turan type Extremal Theory and Generalized Ramsey Theory, Congressus Numerantium 135, (1998), 5-24.  

[163] P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, On the Number of Cycle Lengths in Graphs with Given Minimum Degree and Girth, Discrete Math 200, (1999), 55-60.  

[164]R. J. Faudree, A. Gy'arf'as and J. Lehel, Path Pairable Graphs, J. Comb. Math. Comb. Comp., 29, (1999), 145-157.  

[165] R. J. Faudree, O. Favaron, E. Flandrin, H. Li, and Z. Liu, On 2-Factors in Claw-Free Graphs, Discrete Math. 206, (1999), 131-137.  

[166] R. J. Faudree, Z. Ryjavek, and I. Schiermeyer, Claw-free and generalized bull-free graphs of large diameter are hamiltonian, Tatra Mt. Math. Publ. 18, 1-9.   

[167] R. J. Faudree and A. Gyarfas, Extremal Problems for Forbidden Pairs that Imply Hamiltonicity, Discussiones Mathematicae - Graph Theory 19, (1999), 13-29.  

[168] G. Chen, R. J. Faudree, R. J. Gould, M. S. Jacobson, and L. Lesniak, Cycles in 2-Factors of Balanced Bipartite Graphs, Graphs and Combinatorics 16, (2000), 67-80.  

[169] Y. Egawa, R. J. Faudree, E. Gyori, Y. Ishigami, R. H. Schelp, and H. Wang, Vertex‑Disjoint Cycles Containing Specified Edges, Graphs and Combinatorics 16, (2000), 81-92.  

[170] R. J. Faudree, R. J. Gould, and M. S. Jacobson, Short Cycles in Hamiltonian Braphs, Bull. Inst. Combin. Appl. 28, (2000), 89-98.  

[171] J. R. Faudree, R. J. Faudree, R. J. Gould, M. S. Jacobson, and L. Lesniak, On k-orderable Graphs, J. Graph Theory 35 (2000), 69-82.  

[172] R. J. Faudree, E. Flandrin, M. Jacobson, J. Lehel, and R. H. Schelp, Even Cycles in Graphs with Many Odd Cycles, Graphs and Combinatorics 16 (2000), 399-410.  

[173] R. J. Faudree, R. J. Gould, M. S. Jacobson, and L. Lesniak, Complete Families of Graphs, Bull. Institute Combin. Appl. 31 (2001), 73-87.  

[174] R. J. Faudree, A Survey of Results on k‑Ordered Graphs, Discrete Math. 229 (2001), 73-87.  

[175] P. Erdos, R. J. Faudree, M. J. Jacobson, and J. Lehel, Edge Disjoint Monochromatic Triangles in 2-colored Graphs Discrete Math. 231 (2001), 135-141.  

[176] Weak Clique-Covering Cycles and Paths, Ars Combin. 58 (2001), 67-83.  

[177] R. J. Faudree, A. Gy'arf'as and Miklos Ruszinko, Anti-Ramsey Colorings in Several Rounds, J. Combin. Theory B 82 (2001), 1-18.  

[178] R. J. Faudree and J. R. Faudree, Forbidden Subgraphs that Imply k-Orderable and k-Orderable Hamiltonian, Discrete Math. 243 (2002), 91-108.

[179] R. J. Faudree, Graph Theory - Revised, in Encyclopedia of the Physical Sciences and Technology, Third Edition, Volume 7 Academic Press, 15-31.  

[180] R. J. Faudree, R. J. Gould, M. S. Jacobson and L. M. Lesniak , Characterizing Forbidden Clawless Triples Implying Hamiltonian Graphs, Discrete Math. 249 (2002), 71-81.  

[181] J. Brousek, R. J. Faudree, and Z. Ryj'av{c}ek, A Note on hamiltonicity of generalized net-free graphs of large diameter, Discrete Math. 251 (2002), 77-85  

[182] H. Broersma, R. J. Faudree, A. Huck, H. Trommel, and H.J. Veldman, Forbidden Subgraphs the Imply Hamiltonian-Connectedness, J. Graph Theory 40 (2002), 104-119.  

[183] B. Bollob'as, P. Erdos, R. J. Faudree, C.C. Rousseau, and R. H. Schelp, Random Induced Subgraphs, Discrete Math.  

[184] P. ErdH{o}s,R. J. Faudree, E. Ordman, C. C. Rousseau, and R. H. Schelp, Blocking sets for paths of a given length, J. Combin. Math. Combin. Comput., 40 (2002), 65-78.  

[185] R. J. Faudree and R. H. Schelp, A Survey of Results on The Size Ramsey Number, Paul ErdH{o}s and his Mathematics, II, Bolyai Society Mathematical Studies, 11 (2002), 291-309.  

[186] G. Chen, R. J. Faudree, and M. S. Jacobson, Fragile Graphs with Small Independent Cuts, J. Graph Theory 41 (2002), 327-341.  

[187] R. Gould, A Kostochka, L. Lesniak, I. Schiermeyer, and A. Saito, Degree Conditions for $k$-ordered Graphs, J. Graph Theory, 42 (2003), 199-210.   

[188] Y. Egawa, R. J. Faudree, H. Enomoto, H. Li, I. Schiermeyer, Two-factors each component of which contains a specified vertex, J. Graph Theory 43 (2003), 188--198    

[189] A. Schelten and I. Schiermeyer, r(C_7, C_7, C_7) = 25, Discuss. Math. Graph Theory 23 (2003), 141-158  

[190] R. J. Faudree, R. H. Schelp and Zdenv{e}k Ryj'av{c}ek, On local and global independence numbers of a graph, Discrete Applied Math. 132 (203), 79—84.  

[191] R. J. Faudree, Graph Ramsey Theory, Handbook of Combinatorics, CRC Press, Boca Raton Press, (2004), 837-859.  

[192] R. J. Faudree, R. J. Gould, M. S. Jacobson, L. Lesniak, and A. Saito Toughness, Degrees and $2$-Factors, Discrete Math. 286 (2004), 245-249.  

[193] R. J. Faudree, R. J. Gould, M. S. Jacobson, and L. Lesniak, Generalizing Pancyclic and $k$-Ordered Graphs, Graphs and Combin. 20 (2004), 291—309.  

[194] G. Chen, R. J. Faudree, R. J. Gould, M. S. Jacobson, L. Lesniak, and F. Pfender, Linear Forests and Ordered Cycles, Discuss. Math. - Graph Theory 24 (2004), 359-372.  

[195] R. J. Faudree, J. R. Faudree, R. J. Gould, M. S. Jacobson, and L. Lesniak, Variations of Pancyclic Graphs, J. Combin. Math. J. Combin. Comp. 51 (2004), 33-48.  

[196] M. Ackerman and R. J. Faudree, The Effects of Vertex and Edge Deletion on Graphs,  J. Combin. Math. J. Combin. Comp.  53 (2005), 103-115.    

[197]   R. J. Faudree, R. J. Gould, and M. S. Jacobson, Forbidden triples implying Hamiltonicity: for all graphs,   Discuss. Math. - Graph Theory   24 (2004), 47-54.    

[198] R. J. Faudree, R. J. Gould, and M. S. Jacobson, Potential Forbidden triples implying Hamiltonicity: for all graphs,   Discuss. Math. - Graph Theory   23(3), (2005), 273-289.  

[199] R. J. Faudree, R. J. Gould, M. S. Jacobson, L. Lesniak, and A. Saito,  A Note on $2$-Factors with $2$ Components,   Discrete Math. 300 (2005), no. 1-3, 218--224.  

 [200]  R. J. Faudree, R. J. Gould, M. S. Jacobson, and L. Lesniak, Minimal Degree and (k,m)-Pancyclic Ordered Graphs,  Graphs and Combin. 21 (2005), 197-211.     

 [201]  R. J. Faudree, R. H. Schelp, Akira Saito, and Ingo Schiermeyer, Degree Conditions for hamiltonicity:  Counting the Number of Missing Edges,  Discrete Math. (2006)    

[202] G. Chen, R. J. Faudree, R. J. Gould, and M. S. Jacobson, Cycle Extendability of Hamiltonian Interval Graphs,  SIAM J. Discrete Math. 20(3) 682-689.  

[203] R. J. Faudree, R. J. Gould, M. S. Jacobson, On the Extremal Number of Edges in  2-Factor Hamiltonian Graphs,  Trends in Mathematics Birkhauser Verlag (Basel/Switaerland) (2006), 139-148.  

[204]  R. J. Faudree,  R. H. Schelp, Akira Saito, and Ingo Schiermeyer, Degree Conditions for hamiltonicity:  Counting the Number of Missing Edges,  Discrete Math.  307 (2007), 873-877.
   

[205]  J. R. Faudree, R. J. Faudree, and Zdenv{e}k Ryj'av{c}ek,  Forbidden Subgraphs that Imply  $2$-Factors,    Discrete Math. 308 (2008), 1571-1582.    

[206]  G. Chen, R. J. Faudree, R. J. Gould, and M. S. Jacobson, Non-path Spectrum Sets,   J. Graph Theory  68 (2008), 329-350}.    

[207]  G. Chen, R. J. Faudree, and R. J. Gould, Saturation Numbers of Books,  Electronic Journal of Combinatorics, 15 (2008)  12 pages.   

[208] J. R. Faudree and R. J. Faudree, Hamiltonian Cycles Containing Ordered Linear Forests,  Bull. Institute for Combinatorics and Appl., 55 (2009) 78-83. 
  

[209]  R. J. Faudree, On the Circumference of a Graph and its Complement,    Discrete Math. 309, (2009), 5891-5893.     

[210]  R. J. Faudree, R. J. Gould, M. S. Jacobson, Pancyclic Graphs and Linear Forests,   Discrete Math. 309 (2009), 1178-1189.  

[211]  R. J. Faudree,  M. Ferrara, R. J. Gould, and M. S. Jacobson,  tK(p)-Saturated Graphs of Minimum Size,  Discrete Math. (309), (2009) 5870-5876.         

 [212]  J. R. Faudree,  R. J. Faudree, R. J. Gould, and M. S. Jacobson  Saturation Numbers for Trees,  Electronic J. of Combinatorics  16 (2009),  19pp.  

[213]   R. J. Faudree, R. J. Gould, M. S. Jacobson, and C. Magnant, Ramsey Numbers in rainbow triangle-free colorings,  Australasian J. Combinatorics 46 (2010), 269-274.       

[214]  J. R. Faudree,  R. J. Faudree, R. J. Gould, M. S. Jacobson, and C. Magnant,  Chvatal - Erdos Type Theorems,  Discuss. Math. - Graph Theory  30 (2010), 245-256.

 [215]  G. Chen, R. J. Faudree, and L. Soltes, Path Spectra for Trees,  Discrete Math  310 (2010)  3455-3461
   

 [216]  J. R. Faudree, R. J. Faudree, J. Schmitt, A Survey of Minimum Saturated Graphs,  Electronic Journal of Combinatorics, 18, (2011) 36 pages. 

 [217]  R. J. Faudree, C. Magnant, K. Ozeki, and K. Yoshomoto, Claw-Free Graphs and  2-Factors that Separate Independent Vertices,   J. Graph Theory  69 (2012), 251-263. 

 [218]  R. J. Faudree, R. J. Gould, M. S. Jacobson, and C. Magnant, Distributing Vertices on Hamiltonian Cycles,  J. Graph Theory  69 (2012), 28- 45. 

[219] R. J Faudree,   My Friend and  Colleague - Richard Schelp,  Combinatorics, Geometry, and Probability (2012), 1-9. 

 [220] R. J. Faudree, and Hao Li, Locating pairs of vertices on a Hamiltonian Cycle, Discrete Math. 312, (2012), 2707-2719  

[221]   J. R. Faudree, and R. J. Faudree, Forbidden Subgraphs That Imply  $2$-Factors with a Specified Number of  Components, Bulletin of  Institute Combinatorics  and its Applications 64 (2012), 4-20. 

 [222]  R. J. Faudree, R. J. Gould, and J. Powell,  Property  P(d,m) and Efficient Design of Reliable Networks,  Networks.  60(3)   (2012) 167-178 

 [223]   R. J. Faudree, R. J. Gould, and M. S. Jacobson,   Minimum Degree and Disjoint Cycles in Claw-free Graphs,   Combinatorics, Geometry, and Probability 21 (2012), 129-139.  

[224]  R. J. Faudree,  Connectivity and Cycles,  Topics in Structural Graph Theory, Cambridge University Press, UK, L. Beineke and R. Wilson Eds.   (2013), 114-140.   

 [225]  J. R. Faudree, R. J. Faudree, Zdenek Ryjaek, Petr Vrana, On Forbidden Pairs Implying Hamilton-Connected,   J. Graph Theory  72(3) (2013) 327-345. 

 [226]  R. J. Faudree,  R. J. Gould, and M. S. Jacobson, Minimum Degree and Disjoint Cycles in Generalized Claw-free Graphs,   European J.  Combinatorics,  34, (2013) 875-833. 

 [227]  R. J. Faudree, and R. J. Gould, Saturation Numbers for Nearly Complete Graphs,  Graphs and Combinatorics.  29(3) 2013, 429-448.

[228] R. J. Faudree, C. C. Rousseau and R. H. Schelp, Problems in Graph Theory from Memphis.  The Mathematics of Paul Erdos, Springer Verlag.  95 - 118, 2013.     

 [229]  R. J. Faudree and R. J. Gould, A Note on Powers of Hamiltonian Cycles in Generalized Claw-free Graphs,  Discrete Math. 13, 195-197, (2013).   

 [230]  R. Faudree and R. Gould, Precise location of vertices on Hamiltonian cycles, Discrete Math. 313 (2013), 2772-2777.   

 [231]  R. J. Faudree, R. J. Gould, and M. S. Jacobson,  Weak Saturation Numbers for Sparse Graphs,  Discuss. Math. - Graph Theory   33, (2013), 677-693.

[232] R. J. Faudree,  Ramsey Graph Theory. Handbook of Graph Theory II.    CRC Press, Boca Raton Press (eds. J. Gross, J. Yellen, and P. Zhang), (2014), 1002-1025. (2014), 837-859. 

 [233]  R. Faudree,  J. Lehel and K. Yoshimoto, A Note on Locating pairs of vertices on a Hamiltonian cycle,  Graphs and Combinatorics.   30 (2014), 887–894.

 [234]  R. J. Faudree and R. J. Gould,  Weak Saturation Numbers for Multiple Copies,  Discrete Math, 336  (2014), 1-6.

[235]  Guantao Chen, Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, and Colton Magnant , Saturation Numbers for Linear Forests, submitted to  Graphs and  Combinatorics

[236]  J. R. Faudree, R. J. Faudree, R. J. Gould, and M. S. Jacobson, Linear Forests and Strongly k-Ordered Pancyclic Graphs, submitted to  J. Combin. Math. Combin Comp. 

 [237]  Ralph J. Faudree,  Ronald J. Gould, and Michael S. Jacobson,  Weakly Saturated Graphs, submitted to Discuss. Math. - Graph Theory.

[238]  Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, and Doug West, Minimum Degree and Spanning Caterpillars, submitted to Journal of Combinatorial Theory B.  

[239] R. J. Faudree, J. Lehel and K. Yoshimoto  Locating Pairs of Vertices on a Hamiltonian Cycles in Bigraphs, submitted to  Journal of Graph Theory.

 [240]  R. J. Faudree, Hui Du, J. Lehel and K. Yoshimoto, A panconnected theorem for bipartite graphs, submitted to Journal of Graph Theory. 

 [241] Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, and Colton Magnant, Generalization of Dirac'c Theorem, submitted to  Graphs and Combinatorics. 

Refereed Conference Publications

[1] H. D'Angelo, R. J. Faudree, and T. G. Windeknecht, The Mathematics of Topological Sorting, Proc. of 1976 Conference on Information Sciences and Systems 

[2] S. A. Burr. R. J. Faudree and R. H. Schelp, On Ramsey-Minimal Graphs, Proc. of the 8th S. E. Conf. on Combinatorics, Graph Theory and Computing (1977), 115-124.  

[3] S. A. Burr, P. Erdos, R. J. Faudree and R. H. Schelp, A Class of Ramsey-Finite Graphs, Proc. 9th S.E. Conf. on Combinatorics, Graph Theory and Computing (1978), 171-178.  

[4] R. J. Faudree, C. C. Rousseau, and J. Sheehan, More From the Good Book, Proc. 9th S.E. Conf. on Combinatorics, Graph Theory and Computing (1978), 289-300.  

[5] P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Ramsey Numbers for Brooms, Proc. 13th S.E. Conf. on Comb., Graph Theory and Computing 283-294, (1982).   

[6] R. J. Faudree and J. Sheehan, Tree Ramsey Minimal Graphs, Proc. 13th S.E. Conf. on Comb., Graph Theory and Computing (1982), 283-294.  

[7] R. J. Faudree, On the Ramsey Number for the Five-Spoked Wheel, Congressus Numerantium 44,. Proc. of the Fifteenth S. E. Conf. on Combinatorics, Graph Theory, and Computing. (1984) 47-64  

[8] R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Generalizations of the Tree-Complete Graph Ramsey Number, Graphs and Applications - Proceedings of the First Colorado Symposium on Graph Theory, Frank Harary, editor, John Wiley, (1984), 117-126.   

[9] P. Erdos, R. J. Faudree, C. C. Rousseau and R. H. Schelp, Multipartite Graph - Tree Ramsey Numbers, Annals of the New York Academy of Sciences, 576, Proceedings of the First China - USA International Graph Theory Conf. (1989), 146-154.   

[10] P. Erdos, R. J. Faudree, R. H. Schelp, and M. Simonovits, An Extremal Result for Paths, Annals of The New York Academy of Sceinces, Proceedings of the China - USA Graph Theory Conf. 576 (1989), 155-162.  

[11] P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Edge Conditions for the Existence of Minimal Degree Subgraphs, Graph Theory, Combinatorics, and Applications, Wiley and Sons, New York, Proceedings of the Sixth International Conference on Graph Theory and Applications, (1991), 407-418.  

[12] R. J. Faudree, R. J. Gould and T. Lindquester, Hamiltonian Properties and Adjacency Conditions in K(1,3)-Free Graphs, Graph Theory, Combinatorics, and Applications, Wiley and Sons, New York, Proceedings of the Sixth International Conference on Graph Theory and Applications, (1991), 467-480   

[13] P. Erdos, R. J. Faudree, A. Gyarfas, and R. H. Schelp, Odd Cycles in Graphs of Given Minimal Degree, Graph Theory, Combinatorics, and Applications, Wiley and Sons, New York, Proceedings of the Sixth International Conference on Graph Theory and Applications, (1991), 407-418.  

[14] R. J. Faudree, C. C. Rousseau, and R. H. Schelp, A Good Idea in Ramsey Theory, Graph Theory, Combinatorics, Algorithms, and Applications, Soc. Indust. Appl. Math., Philadelphia, Proceedings of the Second USA - China Graph Theory Conference, (1992), 180-189.  

[15] R. J. Faudree, E. Flandrin, O. Favaron, and H. Li, The Complete Closure of a Graph, Proceedings of Twente Workshop on Hamiltonian Graph Theory, University of Twente, (1992), 61-66.   

[16] R. J. Faudree, Forbidden Subgraphs, Closure, and Hamiltonian Properties -- Recent Results, Graph Theory and Combinatorial Biology (Proc. of the Erdos Conference), Bolyai Soc., Math. Stud. 7, (1999), 9-27.   

[17]  R. J. Faudree, Connectivity and Cycles in Graphs,  Congressum Numernatium 187 (2007) 97-131.      

 [18]  J. R. Faudree and R. J. Faudree, Weak Saturation Numbers for Graphs,  Congressus Numerantium 30 (2014), no. 4, 887–894. 

[19]   R. J. Faudree, Minimum Degree Conditions and Hamiltonian Cycles,  Congressus Numerantium. 222 (2014), 131-137.

Presentations - Conference (refereed *)

PLENARY PRESENTATIONS   

Extremal Problems in Ramsey Theory, NSF - CBMS, Regional Conference on Extremal Graph Theory, Atlanta, Georgia  (1984)

Size Ramsey Functions, International Conference on ``Sets, Graphs and Numbers", Budapest, Hungary  (1990)

Properties of Paired Graphs, New Zealand Mathematics Colloquium, University of Otago, Dunedin, New Zealand  (1991)

Path Pairable Graphs, Twenty-First Manitoba Conference on Numerical Mathematics and Computing, University of Manitoba, Winnipeg, Manitoba  (1991)

Some Results on Claw-Free Graphs, Midwest Combinatorial Conference, Wichita, Kansas (1993)  

Claw-Free Graphs - Survey, Seventh Cumberland Combinatorial Conference, Huntsville, Alabama (1994)  

Hamiltonian Properties in Claw-Free Graphs - Survey, Ninth Clemson mini-Conference on Combinatorics, Clemson, South Carolina (1994)  

Path Matchings in Graphs, Germany Conference on Graph Theory, Elgersberg, Germany. (1996)  

Hamiltonian Properties in Claw-free Graphs, Seventh International Conference on the Theory and Applications of Graph Theory, Kalamazoo, Michigan (1996)  

Recent Results in Claw-free Graphs, International Conference on Combinatorics, Balatonlelle, Hungary (1996)  

Erdos and Generalized Ramsey Theory, Twenty-eighth International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida (1997)  

Extremal Problems of Paul Erdos, Twenty-ninth International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida (1998)  

On k-Ordered Graphs, Fifth Czech-Slovak Internatinal Conference on Combinatorics, Graph Theory, Algorithms and Applications, Prague, Czech Republic (1998)  

Degenerate Extremal Problems, National Siberian Mathematics Meeting, Novosibirsk, Siberia, Russia  (2000)

Degenerate Extremal Problems, Colloquium on Combinatorics,Technical University of Braunschweig, Germany (2000) 

Problems on Paths and Cycles in Graphs, Summer 2001 Workshop on Graphs and Combinatorial Designs, Honolulu, Hawaii. (2001) 

Connectivity and Cycles in Graphs, SIAM Conference on Discrete Mathematics, San Diego, California  (2002)

Connectivity and Cycles in Graphs, Seventeenth Clemson Mini-Conference on Combinatorial Optimization, Clemson, South Carolina (2002)  

Extremal Problems for Hamiltonian Cycles and $2$-Factors in Graphs, Workshop on Extremal Graph Theory, Csopak and Budapest, Hungary  (2003)

Linear Forests, k-Ordered, and Pancyclic Graphs, Conference on Graphs, Wuhan, China  (2005)

 Generalizaions of Pancyclic and  $k$-Ordered Graphs,  Cycles and Colourings Workshop '05,  Tatranska Strba, Slovkia (2005) 

 Linear Forests, $k$-Ordered, and Pancyclic Graphs, Discrete Math and its Applications, Hitachi, Japan (2006)  

Linear Forests, k-ordered, and Pancyclic Graphs, Thirty-eighth S.E.     Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida (2007) 

Connectivity and Cycles in Graphs, Thirty-eighth S.E.   Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida (2007)

Linear Forests, k-Ordered , and Pancyclic Graphs, 22nd Cumberland Conference, Western Kentucky University, Bowling Green, Ky. May (2009)

 The Erdos I knew, Paul Erdos Lecture Series, Memphis, Tennessee (2010)  

 Saturation Numbers, Atlanta Combinatorics Conference, Emory University,  Atlanta, Georgia (2010) 

Linear Forests, $k$-ordered, and Pancyclic Graphs,  International Conference on Graph Theory,  Combinatorics and Applications, Zhejiang Normal University,   Jinhau,  China (2012) . 

 Linear Forests on Hamiltonian Cycles, Summit 240, Renyi Mathematical Institute of the Hungarian Academy of Sciences, Budapest, Hungary.

 Linear Forests on Hamiltonian Cycles, Seventh Cracow Conference on Graph Theory, Rytro, Poland.

OTHER INVITED:

Path Connected Graphs, Amer. Math. Soc. Meeting, Atlanta, Georgia (1973)  

Ramsey Type Results, International Conference on Finite and Infinite Sets, Keszthely, Hungary (1973)  

Generalized Ramsey Theory for Multiple Colors, Amer. Math. Soc. Meeting, Nashville, Tennessee, (1974) 

Various Lengths of Paths in Graphs, International Conference on the Theory and Applications of Graphs, Kalamazoo, Michigan (1976)  

Connected Ramsey Numbers for Paths and Stars, Fifth Hungarian Combinatorial Colloquium, Keszthely, Hungary (1976)  

Pancyclic Graphs-Connected Ramsey Numbers, Amer. Math. Soc. Meeting, Columbia, South Carolina (1976) 

Ramsey Minimal Graphs, Amer. Math. Soc. National Meeting, Atlanta, Georgia, (1978)  

Panarboreal Graphs, Amer. Math. Soc. Regional Meeting, Duluth, Minnesota  (1979)

Ramsey Numbers for Matchings, Amer. Math. Soc. Regional Meeting, Kent, Ohio  (1979)

Generalizations of a Ramsey Result of Chvatal, International Conference on the Theory and Applications of Graph, Kalamazoo, Michigan (1980)  

The Size Ramsey Number, International Conference on Combinatorics, Eger, Hungary  (1981)

Results on Ramsey Minimal Graphs, Mathematical Institute, Hungarian Academy of Sciences (1981)  

Generalizations of Chvatal's Theorem, Mini-Conference on Ramsey Theory, Louisville, Kentucky (1982)  

A Ramsey Problem of Harary, Hoboken Conference on Graph Theory, Hoboken, New Jersey (1983)  

Edge Disjoint Hamiltonian Cycles, Fourth International Conference on the Theory and Applications of Graph Theory, Kalamazoo, Michigan (1984)   

Problems in Generalized Ramsey Theory, American - Hungarian Combinatorics Conference, Budapest, Hungary (1984)  

Multipartite Graph - Tree Ramsey Numbers, Regional Meeting of Amer. Math. Soc., Mobile, Alabama (1985)  

A Neighborhood Condition and Cliques in Graphs, International Combinatorial Conference of the New York Academy of Sciences (1985)  

Some Bipartite Graph - Tree Ramsey Numbers, National Summer Meeting of SIAM, Pittsburg, Pennsylvania (1985)  

Extremal Theory and Bipartite Graph - Tree Ramsey Numbers, First Japan Conference on Graph Theory and Applications, Hakone, Japan,  (1986) 

Multipartite Graph - Tree Ramsey Numbers, First China - USA Conference on Graph Theory and its Applications, Jinan, China (1986)  

Neighborhood Conditions and Subgraphs of Graphs, American - Hungarian Joint Conference on Combinatorics, Chicago, Illinois (1987)  

Menger Path Systems, First Cumberland Conference on Graph Algorithms and Combinatorics, Cookeville, Tennessee (1988)  

Edge Conditions for the Existence of Minimal Degree Subgraphs, Fifth International Conference on the Theory and Applications of Graph Theory, Kalamazoo, Michigan  (1988)

Neighborhood Conditions and Menger Path Systems, ONR Workshop on Communication Networks, Clemson, South Carolina (1988)  

Ramsey Problems and Their Connection to Turan Type Extremal Problems, Second China - USA Graph Theory Conference, San Francisco, California (1989)  

Turan Type Extremal Problems and Ramsey Theory, Regional Meeting of the AMS, Special Session in Graph Theory, Manhattan, Kansas (1990)  

Representations of Paths in Graphs, Third Cumberland Conference on Graph Algorithms and Combinatorics, Louisville, Kentucky (1990)   

Vertices on Odd Cycles, Second Danish Conference on Graph Theory to Honor Petersen, Middlefart, Denmark (1990)  

Extremal Problems and Generalized Degrees, Second International Japan Conference on Graph Theory, Hakone, Japan  (1990) 

Turan Type Extremal Problems and Ramsey Theory, Ramsey Theory Conference, University of Bielefeld, Bielefeld, Germany (1990)  

Path Pairable Graphs, Regional Meeting of the American Mathematical Society, North Dakota State University, Fargo, North Dakota (1991)  

Properties of Paired Graphs, Fifth Cumberland Conference on Graph Algorithms and Combinatorics, Johnson City, Tennessee (1992)  

The Spectrum of a Graph, Sixth International Conference on the Theory and Applications of Graph Theory, Kalamazoo (1992)  

Monochromatic Spanning Trees in 2-Colored Graphs, Regional Meeting of the American Mathematical Society, Howard Universiy, Washington, D.C. (1993)  

Some Strong Variations of Connectivity, International Conference - Paul ErdHos is Eighty, Keszthely, Hungary (1993)  

Forbidden Subgraphs and Hamiltonian Properties, Regional Meeting of the American Mathematical Society, University of Kentucky, Lexington, Ky. (1994)  

Hamiltonian Properties in Claw-free Graphs, Special Session at the National Meeting of the American Mathematical Society, San Francisco, Ca. (1995)  

Erdos and Graphical Ramsey Theory, Erdos Memorial Conference, Budapest, Hungary (1996)  

Extremal Problems for Cycles, International Colloquium on Extremal Graphs, Balatonlelle, Hungary (1997)  

Coloring Complete Graphs, Special Session on Combinatorics and Graph Theory, Regional Meeting of the American Mathematical Society, Louisville, Ky. (1998)   

r(C4,,C4, C4) = 17, Twelfth Cumberland Conference, Johnson City, Tn. (1998)  

Anti-Ramsey Colorings in Several Rounds, ACCOTA Meeting, Oaxaca, Mexico (1998)  

Anti-Ramsey Colorings in Several Rounds, Special Session of Winter Meeting of the Canadian Mathematical Society, Kingston, Ontario, Canada. (1998)  

2‑Factors Containing Specified Edges, Special Session on Combinatorics and Graph Theory, Regional Meeting of the American Mathematical Society, Urbana, Illinois (1999)  

Generalizations of Results of Dirac and Ore, Mini‑Conference associated with the Erdos Memorial Lecture Series, University of Memphis, Memphis, Tennessee (1999)  

Minimum Degree Conditions and k-Ordered Graphs, Twelfth Cumberland Conference on Combinatorics and Graphs Theory, Louisville, Kentucky (1999)  

Two Generalized Ramsey Conjectures of Erdos, Paul Erdos and his Mathematics Conference, Budapest, Hungary (1999)  

Fragile Graphs, Special Session on Combinatorics and Graph Theory, Regional Meeting of the American Mathematical Society, Lafayette, Louisiana (2000)  

Degenerate Extremal Problems, Ninth Quadrennial International Conference on the Theory and Applications of Graph Theory, Kalamazoo (2001) 

Extremal Problems Involving Cycles, Workshop, Novosibirsk Mathematical Institute, Novosibirsk, Siberia, Russia (2001) 

On Local and Global Independence Numbers of a Graph, Special Session on Combinatorics and Graph Theory, Regional Meeting of the American Mathematical Society, Las Vegas, Nevada (2001) 

Forbidden Subgraphs the Imply 2-Factors, Special Session on Combinatorics and Graph Theory, Regional Meeting of the American Mathematical Society, Chattanooga, Tennessee (2002)  

Extremal Problems Involving Cycles, Workshop, Novosibirsk Mathematical Institute, Novosibirsk, Siberia, Russia (2003) 

On Variations of Pancyclic Graphs, Fifteenth Cumberland Combinatorial Conference, Oxford, Mississippi (2003)  

Forbidden Subgraphs Implying 2-Factors in Graphs, Special Session on Graph Theory at Regional Meeting of the Amer. Math. Soc., Bloomington, Indiana (2003)  

Forbidden Subgraphs Implying 2-Factors in Graphs, Sixteenth Cumberland Conference, Georgia State University, Atlanta, Georgia (2003)  

Generalizing Pancyclic and k-ordered Graphs, Bollob'as Conference, Trinity College, Cambridge University, Cambridge, England (2004)  

Forbidden Subgraphs Implying 2-Factors with k Components, Special Session on Graph Theory at Regional Meeing of the Amer. Math. Soc., University of Colorado, Bolder, Colorado (2004)  

Forbidden Subgraphs Implying 2-Factors with a Specified Number of Components, Seventeenth Cumberland Combinatorial Conference, Murfreesboro, Tennessee (2004)  

Generalizing Pancyclic and k-ordered Graphs, Discrete Math. Conference, Society for Industrial and Applied Math., Nashville, Tennessee (2005)  

Hamiltonian Graphs and Linear Forests, Regional Meeting of the Amer. Math. Soc. Vanderbilt University, Nashville, Tennessee (2005)   

Forbidden Subgraphs Implying 2-Factors in Graphs, Special Session on Graph Theory at National Meeting of the Amer. Math. Soc., Atlanta, Georgia.  (2005)  

Hamiltonian Graphs Containing Ordered Linear Forest,   Nineteenth Cumberland Combinatorial Conference, Johnson,  Tennessee (2006) 

Hamiltonian Graphs Containing Ordered Linear Forest,  SIAM Conference on Discrete Math., Victoria, British, Columbia,  Canada (2006)

Graphs Containing Hamiltonian Cycles with Uniformly Distributed Vertices and Edges,  Special Session on Graph Theory at the Regional Meeting of the American Mathematical Society, Fayetteville, Arkansas (2006)

Linear Forests, k-ordered, and Pancyclic Graphs,  Special Session on Graph Theory at  the Regional Meeting of the American Mathematical Society, Miami of Ohio, Oxford, Ohio (2007) 

Linear Forests, k-ordered, and Pancyclic Graphs, 11th Erdos Memorial Lecture Series,  University of Memphis, Memphis (2007) 

 Chvatal - Erdos Type Theorems, 31st SIAM Southeastern-Atlantic Section Meeting - Discrete Mathematics Special     Section, Memphis, Tennessee (2007)

Monochromatic Cycles in Edge Colored Graphs, Twentieth Cumberland Combinatorial  Conference, Emory University, Atlanta, Georgia (2007)

Extremal Problems for Cycles in Graphs, Extremal Graph Theory Workshop,  Renyi Institute of Mathematics, Budapest, Hungary (2007) 

Linear Forests, k-ordered, and Pancyclic Graphs, Conference on Graph Theory and  Combinatorial Analysis 07   (GTCA07),  Beijing, China (2007) 

Minimum Degree and Edge Hamiltonian Digraphs, Special Session on Graph Theory at  the Regional Meeting of the American Mathematical Society, Middle Tennessee State University, Murfreesboro, Tennessee (2007) 

Saturation Numbers of Books, Special Session on Graph Theory at the National Winter Meeting of the American Mathematical Society, San Diego, California (2008) 

Forbidden Subgraphs, Hamiltonian Properties and 2-Factors in Graphs, Workshop ZF60 for Zdenv{e}k Ryj'av{c}ek, Pavlov, Czech Republic (2008)

Forbidden Subgrahs and 2-Factors in Graphs, Twentyfirst Cumberland Combinatorial Conference, Vanderbilt University, Nashville, Tennessee, (2008)}
  

Saturation Numbers, International Conference on Interdiscipinary Mathematical &  Statistical Techniques, University of Memphis, Memphis, Tennessee (2008)  

Saturation Numbers, Special Session on Probabilistic and Extremal Graph Theory,   Joint Meeting of the American Mathematical Society and Mathematical Society of  Brazil, Rio de Janeiro, Brazil (2008)   

Path Spectrum Sets, Minisymposium on Cycles and Paths in Graphs, SIAM Conference on Discrete Mathematics, University of Vermont, Burlington, Vermont (2008) 

 Saturation Numbers, Fete of Mathematics, Lovasz Conference, Keszthely, Hungary (2008)

 Path Spectrum Sets, Special Session in Graph Theory, Regional Meeting of the American Mathematical Society, Huntsville, Alabama (2008)

Saturation Numbers for Forests, Special Session on Graph Theory at  the Regional Meeting of the American Mathematical Society, Champaign - Urbana, Illinois (2009)

 Path Spectrum Sets for Trees Minisymposium on Cycles and Paths in Graphs, National  Meeting of SIAM, Denver, Colorado (2009) 

Some Open Problems in Graph Theory,  Workshop on Cycles and Paths in Graphs,   University Colorado  at Denver, Denver, Colorado (2009)  

 Survey of Saturation Numbers, Twentythird Cumberland Combinatorial Conference, University of Mississippi, Oxford, Misssissippi, (2010)

 Placing vertices on Hamiltonian Cycles, Eighth French Combinatorial  Conference, University of Paris-Sud, Orsay, France (2010)

Minimum Degree and Disjoint Cycles in Generalized Claw-Free Graphs, Sixth Workshop  on Matthews-Sumner Conjecture, Domazlice, Czeh Republic, (2011)        

Dick Schelp - Colleague and Friend, Paul Erdos Lecture Series,  University of Memphis, Memphis, Tennessee, (2011)  

Minimum Degree and Disjoint Cycles in Generalized Claw-Free Graphs,  Twentyfourth Cumberland Combinatorial Conference, University of Louisville,  Louisville, Kentucky, (2011) 

 Minimum Degree and Disjoint Cycles in Generalized Claw-Free Graphs,   Sixth Workshop  on Matthews-Sumner Conjecture, Domazlice, Czeh Republic  (2011)

 Mathews-Sumner Conjecture, Summer Discrete Mathematics Conference  of S.I.A.M., Halifax, Nova Scotia, Canada (2012). 

John Haddock - Colleague and Friend, Haddockfest, Differential Equations Workshop, University of Memphis, Memphis, Tennessee (2013). 

 Minimum Degree and Disjoint Cycles in Generalized Claw-Free Graphs, Sectional Meeting of the American Mathematical Society,  University of Mississippi, Oxford, Mississippi (2013). 

 Saturation Numbers for Graphs,  Sectional Meeting of the American Mathematical Society,  University of Colorado, Bolder, Colorado (2013).

 Locating Vertices on Hamiltonian Cycles, Award Ceremony for Irvin Gyori, Hungarian Academy of Sciences, Budapest, Hungary (2013).

 Erdos Centennial Conference, Combinatorics Section, Hungarian Academy of Sciences, Budapest, Hungary (2013).

Minimum Degree and Disjoint Cycles in Claw-free and Generalized Claw-free Graphs,  Minisymposium on Cycles and Paths in Graphs, Discrete Math Meeting of SIAM, Minneapolis, Minnesota. (2014)
  

Presentations - Universities/Industry (refereed *)

COLLOQUIUM PRESENTATIONS  

Subgroups of the Mulitplicative Group of a Division Ring, Colloquium, Purdue University, West Lafayette, Indiana (1964) 

Subgroups of the Mulitplicative Group of a Sfield, Colloquium, University of California at Berkeley, Berkeley, California (1965) 

Embedding Groups in Division Rings, Colloquium, University of Illinois at Urbana, Urbana, Illinois (1967) 

Varieties of Groups, Colloquium Series, University of Cincinnati, Cincinnati, Ohio (1970) 

Embedding Graphs in the Plane, Colloquium, Virginia Commanwealth University, Richmond, Virginia (1971) 

Varieties of Groups, Memphis State University, Memphis, Tennessee (1971) 

Genus of a Graph, Southwestern at Memphis, Memphis, Tennessee (1974) 

Some Results on Ramsey Minimal Graphs, Cambridge Colloquium Series, U. of Cambridge, England. (1980) 

Tree Ramsey Minimal Graphs, Colloquium, Univ. of Aberdeen, Aberdeen, Scotland (1980) 

Some Results on the Size Ramsey Number, Univ. of Glasgow Colloquium Series, Glasgow, Scotland (1980) 

Results on Generalized Ramsey Number, Univ. of Reading Colloquium Series, Reading, England (1980) 

Theory of Generalized Ramsey Minimal Graphs, Mathematical Institute of the Hungarian Academy of Sciences, Budapest, Hungary (1981) 

Neighborhood Conditions and Paths and Cycles in Graphs, Colloquium, Huazhong Normal University, Wuhan, China (1986) 

Extremal Problems for Degree and Neighborhood Conditions, Colloquium, University of Louisville, Louisville, Kentucky (1987) 

Path Pairable Graphs, Colloquium, Mathematical Institute, Hungarian Academy of Sciences, Budapest, Hungary (1990) 

Graphs with a Pairing Property, Colloquium, Technical University of Braunschweig, Braunschweig, Germany (1991) 

Networks Communicating for Each Pairing of Terminals, Colloquium, University of Twente, Enschede, Netherlands (1991) 

Path Pairable Graphs, Colloquium, University of Aberdeen, Scotland Networks and Path Pairable Graphs, Colloquium, CNRS Laboratory, Orsay, France (1991) 

Path Pairable Graphs, Colloquium, University of Malaya, Kuala Lumpur, Malaysia (1991) 

Connectivity in Graphs, Colloquium, National University of Singapore, Singapore (1991) 

Complete Stability Number of Graphs, Colloquium, National University of Singapore, Singapore (1991) 

Networks Communicating for Each Pairing of Terminals, Colloquium, Australian National University, Canberra, Australia (1991) 

Complete Closure of Graphs, Colloquium, University of Aukland, Aukland, New Zealand (1991) 

Generalized Connectivity Conditions, Generalized Degrees and Hamiltonian Cycles, Ramsey Theory and Tur'an-Type (1991) 

Extremal Theory, A series of six Colloquia, Free University of Berlin, Berlin, Germany (1992) 

Monochromatic Trees in 2-Colored Graphs, Colloquium, North Dakota State University (1993) 

Extremal Problems for Subgraph Density, Colloquium, North Dakota State University (1993) 

Forbidden Subgraphs and Hamiltonian Properties, Colloquium, CNRS Laboratory, Orsay, France (1994) 

Tur'an Theory and Ramsey Numbers, Colloquium, der Rhein.-Westf. Techn. Hochschule, Aachen, Germany (1994) 

Complete Graphs with Large Degree Sums, Colloquium, University of West Virginia, Morgantown, West Virginia (1995) 

Complete Graphs with Large Degree Sums, Colloquium, Georgia State University, Atlanta, Georgia (1996) 

Balanced Subgraphs in Graphs, Colloquium, University of Twente, Enschede, The Netherlands (1996) 

Anti‑Ramsey Colorings in Several Rounds, Colloquium, Technical University of Cottbus, Cottbus, Germany (1998) 

Anti‑Ramsey Colorings in Several Rounds, Colloquium, University of Alaska, Fairbanks, Alaska (1999) 

$2$‑Factors that Separate Edges, Colloquium, University of Alaska, Fairbanks, Alaska (1999) 

Connectivity and Cycles in Graphs, Colloquium, University of Alaska, Fairbanks, Alaska  (2002)

Generalizations of Pancyclic and k-ordered Graphs, Colloquium, University of Alaska, Fairbanks, Alaska (2004) 

Generalizations of Pancyclic and k-ordered Graphs, Colloquium, Middle Tennessee State University, Murfreesboro, Tennessee (2004) 

Problems in Graph Theory, Colloquium,  Three Gorges University, Yichang, China (2004)

Generalizaions of Pancyclic and  $k$-Ordered Graphs, Colloquium,  Fuzhou University, Fuzhou, China (2004)

Linear Forests, $k$-ordered, and Pancyclic Graphs, Colloquium, University of Illinois, Champaign (2006)  

Monochromatic Cycles in Edge Colored Graphs and  Chvat'al - ErdH{o}s Type Theorems, Colloquium, Tongji University, Shanghai, China (2007)

Monochromatic Cycles in Edge Colored Graphs and  Chvat'al - ErdH{o}s Type Theorems, Colloquium, Central Normal University, Wuhan, China (2007)

Extremal Problems for Cycles in Graphs, Colloquium, Three Gorges University, Yichang, China (2007) 

Survey of Saturation Numbers, Colloquium, Georgia Southern University,    Stateboro, Georgia  (2012)   

 Minimum Degree Conditions for Cycles in Claw-Free Graphs, Colloquium,   Emory University, Atlanta, Georgia  (2012).  

 Saturation Numbers, Colloquium, University of Alaska at Fairbanks, Fairbanks, Alaska  (2012).  

Weak Saturation Numbers, Colloquium, Tongji University, Shanghai, China  (2012).  

 Weak Saturation Numbers, Fortyfourth S.E. Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida (2013) 

 Minimum Degree and Disjoint Cycles in Claw-Free and Generalized Claw-Free Graphs, Colloquium, Alfr'ed R'enyi Mathematical Institute, Budapest, Hungary (2013).

 Linear Forests on Hamiltonian Cycles, Colloquium, Department of Information Science, Nihon University, Tokyo, Japan (2013).

 Minimum Degree and Disjoint Cycles in Claw-free and Generalized Claw-free Graphs, Alavi Symposium, Western Michigan University, Kalamazoo, Michigan (2013). 

Other Presentations (refereed *)

CONTRIBUTED PAPERS  

Ramsey Numbers for Paths and Cycles in Graph, Amer. Math. Soc. Meeting, Dallas, Texas, (with R. H. Schelp) (1973) 

The Square of a Block is Strongly Path Connected, Amer. Math. Soc. Meeting, San Francisco, California, (with R. H. Schelp) (1974) 

Ramsey Numbers for all Linear Forests, Amer. Math. Soc. Meeting, Washington, D.C., (with R. H. Schelp) (1975) 

Ramsey Finite Graphs, Ninth S.E. Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida, (with S. A. Burr, P. ErdHos, R. H. Schelp) (1978) 

On a Class of Degenerated Extremal Graph Problems, Amer. Math. Soc. Meeting, Cincinnati, Ohio, (with M. Simonovits) (1982) 

Tree Ramsey Minimal Graphs, Thirteenth S.E. Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida, (with J. Sheehan)  (1982)  

Ramsey Numbers Involving Sparse Graphs, Fourteenth S.E. Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida, (with P. ErdHos, C. C. Rousseau, R.H. Schelp) (1983)  

On the Ramsey Number for the Five-Spoked Wheel, Fifteenth S.E. Conference on Combinatorics, Graph Theory, and Computing, Baton Rouge, Louisiana (with J. Sheehan) (1984)  

Neighborhood Conditions and Edge Disjoint Hamiltonian Cycles, Eightteenth S.E. Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida, (with R.J. Gould and R.H. Schelp) (1987)  

Menger's Theorem for Short Paths, Second Carbondale Conference on Combinatorics, Carbondale, Ill., (M. S. Jacobson, R. H. Schelp) (1987) 

Extremal Poblems for Degree Sequences, Seventh Hungarian Colloquium on Finite and Infinite Sets, Eger, Hungary, (with S. A. Burr, P. ErdHos, A. Gyarfas, and R. H. Schelp) (1987) 

Cycles in Graphs without proper subgraphs of minimal degree 3, Eleventh British Combinatorics Conference, London, (with P. Erdos, A. Gyarfas, R. H. Schelp) (1987) 

Graphs with an Ascending Subgraph Decomposition, Nineteenth S.E. Conference on Combinatorics, Graph Theory, and Computing, Baton Rouge, Louisiana, (with R. J. Gould, M. S. Jacobson, and L. Lesniak) (1988)  

Menger Path Systems, Third Carbondale Conference on Combinatorics, Carbondale, Ill., (R. J. Gould and R. H. Schelp)  (1988)

Ascending Subgraph Decompositions for Forests, Twentieth S.E. Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida, (with R. J. Gould) (1989)  

On Some Ramsey Type Problems Connected with Paths, Cycles and Trees, Twelfth British Combinatorics Conference, London, (with P. Erdos, R. H. Schelp and M. Simonovits) (1989) 

Extremal Problems and the Diameter of Deleted Graphs, Twenty-First S.E. Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida, (with P.K. Card and C. M. Wong)  (1990) 

Extremal Problems for Menger Path Systems, Fourth Carbondale Conference on Combinatorics, Carbondale, Ill., (R. J. Gould and V. RHodl)  (1990)

Grid Number of a Graph, Twentythird S.E. Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida. (1992)  

Degree Sums, $k$-Factors and Hamiltonian Cycles in Graphs, Twentyforth S.E. Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida. (with Jan van den Heuvel) (1993)  

Characterization of Forbidden Pairs of Graphs That Imply Hamiltonicity, Twentyfifth S.E. Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida. (with Ron Gould) (1994) 

Number of Cycle Lengths in Graphs with Minimum Degree and Large Girth, Twentysixth S.E. Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida. (with Paul Erdos, C. C. Rousseau, and R. H. Schelp) (1995) 

Path Matchings in Graphs, Twentyseventh S.E. Conference on Combinatorics, Graph Theory, and Computing, Baton Rouge,  (1996)

Edge Disjoint Monochromatic Triangles in 2‑Colored Graphs, Nineteenth British Combinatorial Conference, University of Kent, Cantebury, England  (1999) 

 Weak Saturation Numbers}, Fortyfourth S.E. Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida (2013).

Appendix A