Richard H. Schelp

104 papers Journal 103

Year	Rank	Type	Title / Venue / Authors
2018	J	`jnl`	Decompositions of graphs into cycles with chords. J. Comb. Theory B Paul Balister, Hao Li, Richard H. Schelp
2014	J	`jnl`	An Extremal Problem Resulting in Many Paths. Ars Comb. Richard H. Schelp, Kiyoshi Yoshimoto
2013	—	`ch.`	Problems in Graph Theory from Memphis. The Mathematics of Paul Erdős II Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
2012	J	`jnl`	Some Ramsey-Turán type problems and related questions. Discret. Math. Richard H. Schelp
2011	J	`jnl`	Coloring vertices and edges of a graph by nonempty subsets of a set. Eur. J. Comb. Paul N. Balister, Ervin Györi, Richard H. Schelp
2011	J	`jnl`	Long rainbow cycles in proper edge-colorings of complete graphs. Australas. J Comb. András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Richard H. Schelp
2010	J	`jnl`	A new class of Ramsey-Turán problems. Discret. Math. H. Li, Vladimir Nikiforov, Richard H. Schelp
2009	J	`jnl`	Multipartite Ramsey numbers for odd cycles. J. Graph Theory András Gyárfás, Gábor N. Sárközy, Richard H. Schelp
2008	J	`jnl`	Connected graphs without long paths. Discret. Math. Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
2008	J	`jnl`	Cycles and stability. J. Comb. Theory B Vladimir Nikiforov, Richard H. Schelp
2008	J	`jnl`	Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs. J. Comb. Theory B András Gyárfás, Jenö Lehel, Gábor N. Sárközy, Richard H. Schelp
2007	J	`jnl`	Adjacent Vertex Distinguishing Edge-Colorings. SIAM J. Discret. Math. Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
2007	J	`jnl`	Decomposition of bipartite graphs into special subgraphs. Discret. Appl. Math. Guantao Chen, Richard H. Schelp
2007	J	`jnl`	Degree conditions for hamiltonicity: Counting the number of missing edges. Discret. Math. Ralph J. Faudree, Richard H. Schelp, Akira Saito, Ingo Schiermeyer
2007	J	`jnl`	Finding a monochromatic subgraph or a rainbow path. J. Graph Theory András Gyárfás, Jenö Lehel, Richard H. Schelp
2007	J	`jnl`	Making the components of a graph k-connected. Discret. Appl. Math. Vladimir Nikiforov, Richard H. Schelp
2006	J	`jnl`	Cycle lengths in graphs with large minimum degree. J. Graph Theory Vladimir Nikiforov, Richard H. Schelp
2006	J	`jnl`	Mono-multi bipartite Ramsey numbers, designs, and matrices. J. Comb. Theory A Paul N. Balister, András Gyárfás, Jenö Lehel, Richard H. Schelp
2006	J	`jnl`	Ramsey unsaturated and saturated graphs. J. Graph Theory Paul N. Balister, Jenö Lehel, Richard H. Schelp
2004	J	`jnl`	Balanced edge colorings. J. Comb. Theory B Paul N. Balister, Alexandr V. Kostochka, Hao Li, Richard H. Schelp
2004	J	`jnl`	Cycles and paths in graphs with large minimal degree. J. Graph Theory Vladimir Nikiforov, Richard H. Schelp
2004	J	`jnl`	Longest Paths in Circular Arc Graphs. Comb. Probab. Comput. Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
2003	J	`jnl`	Contractibility techniques as a closure concept. J. Graph Theory Zdenek Ryjácek, Richard H. Schelp
2003	J	`jnl`	Every 3-connected distance claw-free graph is Hamilton-connected. Discret. Math. Rao Li, Richard H. Schelp
2003	J	`jnl`	Graphs with large maximum degree containing no odd cycles of a given length. J. Comb. Theory B Paul Balister, Béla Bollobás, Oliver Riordan, Richard H. Schelp
2003	J	`jnl`	Nearly bipartite graphs. Discret. Math. Ervin Györi, Vladimir Nikiforov, Richard H. Schelp
2003	J	`jnl`	On local and global independence numbers of a graph. Discret. Appl. Math. Ralph J. Faudree, Zdenek Ryjácek, Richard H. Schelp
2003	J	`jnl`	Vertex-distinguishing edge colorings of graphs. J. Graph Theory Paul N. Balister, O. M. Riordan, Richard H. Schelp
2002	J	`jnl`	A note on Ramsey size-linear graphs. J. Graph Theory Paul N. Balister, Richard H. Schelp, Miklós Simonovits
2002	J	`jnl`	Hamiltonicity of {K Discret. Math. Rao Li, Richard H. Schelp
2002	J	`jnl`	Random induced graphs. Discret. Math. Béla Bollobás, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
2002	J	`jnl`	Three edge-coloring conjectures. Discuss. Math. Graph Theory Richard H. Schelp
2002	J	`jnl`	Two-edge colorings of graphs with bounded degree in both colors. Discret. Math. Ervin Györi, Richard H. Schelp
2002	J	`jnl`	Vertex distinguishing colorings of graphs with Delta(G)=2. Discret. Math. Paul N. Balister, Béla Bollobás, Richard H. Schelp
2001	J	`jnl`	Claw-free graphs with complete closure. Discret. Math. Zdenek Ryjácek, Akira Saito, Richard H. Schelp
2001	J	`jnl`	Ramsey minimal graphs. J. Braz. Comput. Soc. Béla Bollobás, Jair Donadelli, Yoshiharu Kohayakawa, Richard H. Schelp
2001	J	`jnl`	Relative length of longest paths and cycles in 3-connected graphs. J. Graph Theory Rao Li, Akira Saito, Richard H. Schelp
2000	J	`jnl`	Even Cycles in Graphs with Many Odd Cycles. Graphs Comb. Ralph J. Faudree, Evelyne Flandrin, Michael S. Jacobson, Jeno Lehel, Richard H. Schelp
2000	J	`jnl`	Local and Mean Ramsey Numbers for Trees. J. Comb. Theory B Béla Bollobás, Alexandr V. Kostochka, Richard H. Schelp
2000	J	`jnl`	On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs. J. Graph Theory Richard H. Schelp, Andrew Thomason
2000	J	`jnl`	Some hamiltonian properties of Discret. Math. Rao Li, Richard H. Schelp
2000	J	`jnl`	Vertex-Disjoint Cycles Containing Specified Edges. Graphs Comb. Yoshimi Egawa, Ralph J. Faudree, Ervin Györi, Yoshiyasu Ishigami, Richard H. Schelp, Hong Wang
1999	J	`jnl`	Closure and Hamiltonian-connectivity of claw-free graphs. Discret. Math. Béla Bollobás, Oliver Riordan, Zdenek Ryjácek, Akira Saito, Richard H. Schelp
1999	J	`jnl`	Closure, 2-factors, and cycle coverings in claw-free graphs. J. Graph Theory Zdenek Ryjácek, Akira Saito, Richard H. Schelp
1999	J	`jnl`	The number of cycle lengths in graphs of given minimum degree and girth. Discret. Math. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1998	J	`jnl`	A Communication Problem and Directed Triple Systems. Discret. Appl. Math. András Gyárfás, Richard H. Schelp
1998	J	`jnl`	A Remark on the Number of Complete and Empty Subgraphs. Comb. Probab. Comput. Richard H. Schelp, Andrew Thomason
1998	J	`jnl`	Vertex colorings with a distance restriction. Discret. Math. Guantao Chen, András Gyárfás, Richard H. Schelp
1997	J	`jnl`	A Class of Edge Critical 4-Chromatic Graphs. Graphs Comb. Guantao Chen, Paul Erdös, András Gyárfás, Richard H. Schelp
1997	J	`jnl`	A New Game Chromatic Number. Eur. J. Comb. Guantao Chen, Richard H. Schelp, Warren E. Shreve
1997	J	`jnl`	A special k-coloring for a connected k-chromatic graph. Discret. Math. Guantao Chen, Richard H. Schelp, Warren E. Shreve
1997	J	`jnl`	Graphs with given odd sets. J. Graph Theory Guantao Chen, Richard H. Schelp, Lubomír Soltés
1997	J	`jnl`	Local and mean J. Graph Theory Richard H. Schelp
1997	J	`jnl`	Special monochromatic trees in two-colored complete graphs. J. Graph Theory Guantao Chen, Richard H. Schelp, Lubomír Soltés
1997	J	`jnl`	Vertex-distinguishing proper edge-colorings. J. Graph Theory Anita C. Burris, Richard H. Schelp
1996	J	`jnl`	An edge coloring problem for graph products. J. Graph Theory Ralph J. Faudree, András Gyárfás, Richard H. Schelp
1996	J	`jnl`	Sizes of graphs with induced subgraphs of large maximum degree. Discret. Math. Paul Erdös, Talmage James Reid, Richard H. Schelp, William Staton
1996	J	`jnl`	Strong edge colorings of graphs. Discret. Math. Odile Favaron, Hao Li, Richard H. Schelp
1995	J	`jnl`	Degree sequence and independence in K(4)-free graphs. Discret. Math. Paul Erdös, Ralph J. Faudree, Talmage James Reid, Richard H. Schelp, William Staton
1995	J	`jnl`	Hamiltonicity for J. Graph Theory Guantao Chen, Richard H. Schelp
1995	J	`jnl`	The drawing Ramsey number Dr(K Australas. J Comb. Heiko Harborth, Ingrid Mengersen, Richard H. Schelp
1995	J	`jnl`	Vertex disjoint cycles for star free graphs. Australas. J Comb. Guantao Chen, Lisa R. Marcus, Richard H. Schelp
1994	J	`jnl`	A local density condition for triangles. Discret. Math. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1994	J	`jnl`	Hamiltonian graphs with neighborhood intersections. J. Graph Theory Guantao Chen, Richard H. Schelp
1994	J	`jnl`	Local edge colorings that are global. J. Graph Theory R. A. Clapsadle, Richard H. Schelp
1994	J	`jnl`	Neighborhood unions and the cycle cover number of a graph. J. Graph Theory Guantao Chen, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp
1994	J	`jnl`	On the rotation distance of graphs. Discret. Math. Ralph J. Faudree, Richard H. Schelp, Linda M. Lesniak, András Gyárfás, Jenö Lehel
1993	J	`jnl`	A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness. Discret. Math. P. Bedrossian, Guantao Chen, Richard H. Schelp
1993	J	`jnl`	Graphs with Linearly Bounded Ramsey Numbers. J. Comb. Theory B Guantao Chen, Richard H. Schelp
1993	J	`jnl`	Rainbow coloring the cube. J. Graph Theory Ralph J. Faudree, András Gyárfás, Linda M. Lesniak, Richard H. Schelp
1993	J	`jnl`	Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs. Eur. J. Comb. Paul Erdös, Guantao Chen, Cecil C. Rousseau, Richard H. Schelp
1993	J	`jnl`	Ramsey Problems With Bounded Degree Spread. Comb. Probab. Comput. Guantao Chen, Richard H. Schelp
1993	J	`jnl`	Ramsey Size Linear Graphs. Comb. Probab. Comput. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1992	J	`jnl`	Hamiltonian graphs involving distances. J. Graph Theory Guantao Chen, Richard H. Schelp
1992	J	`jnl`	Networks communicating for each pairing of terminals. Networks László Csaba, Ralph J. Faudree, András Gyárfás, Jenö Lehel, Richard H. Schelp
1990	J	`jnl`	Subgraphs of minimal degree k. Discret. Math. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1989	J	`jnl`	Domination in colored complete graphs. J. Graph Theory Paul Erdös, Ralph J. Faudree, András Gyárfás, Richard H. Schelp
1989	J	`jnl`	Induced matchings in bipartite graphs. Discret. Math. Ralph J. Faudree, András Gyárfás, Richard H. Schelp, Zsolt Tuza
1989	J	`jnl`	Irregular networks, regular graphs and integer matrices with distinct row and column sums. Discret. Math. Ralph J. Faudree, Richard H. Schelp, Michael S. Jacobson, Jenö Lehel
1989	J	`jnl`	Neighborhood unions and hamiltonian properties in graphs. J. Comb. Theory B Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp
1988	J	`jnl`	Extremal theory and bipartite graph-tree Ramsey numbers. Discret. Math. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1988	J	`jnl`	Intersection Theorems for t-Valued Functions. Eur. J. Comb. Richard H. Schelp, Miklós Simonovits, Vera T. Sós
1988	J	`jnl`	Small order graph-tree Ramsey numbers. Discret. Math. Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1987	J	`jnl`	A Ramsey problem of Harary on graphs with prescribed size. Discret. Math. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1987	J	`jnl`	Extremal problems involving neighborhood unions. J. Graph Theory Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp
1987	J	`jnl`	Goodness of trees for generalized books. Graphs Comb. Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp, Ronald J. Gould, Michael S. Jacobson
1987	J	`jnl`	Local J. Comb. Theory B András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza
1987	J	`jnl`	Ramsey numbers for local colorings. Graphs Comb. András Gyárfás, Jeno Lehel, Richard H. Schelp, Zsolt Tuza
1986	J	`jnl`	Some intersection theorems on two valued functions. Comb. Ralph J. Faudree, Richard H. Schelp, Vera T. Sós
1985	J	`jnl`	Multipartite graph - space graph Ramsey numbers. Comb. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1985	J	`jnl`	On Graphs with Ramsey-Infinite Blocks. Eur. J. Comb. Stefan A. Burr, Ralph J. Faudree, Richard H. Schelp
1984	J	`jnl`	An extremal problem for paths in bipartite graphs. J. Graph Theory András Gyárfás, Cecil C. Rousseau, Richard H. Schelp
1983	J	`jnl`	On Ramsey numbers involving starlike multipartite graphs. J. Graph Theory Stefan A. Burr, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1982	J	`jnl`	Graphs with certain families of spanning trees. J. Comb. Theory B Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1982	J	`jnl`	Ramsey-minimal graphs for forests. Discret. Math. Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1981	J	`jnl`	Ramsey-minimal graphs for star-forests. Discret. Math. Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1980	J	`jnl`	All triangle-graph ramsey numbers for connected graphs of order six. J. Graph Theory Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1980	J	`jnl`	Ramsey numbers for matchings. Discret. Math. Ralph J. Faudree, Richard H. Schelp, J. Sheehan
1978	J	`jnl`	On cycle - Complete graph ramsey numbers. J. Graph Theory Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1978	J	`jnl`	Some connected ramsey numbers. J. Graph Theory Ralph J. Faudree, Richard H. Schelp
1976	J	`jnl`	Ramsey numbers for all linear forests. Discret. Math. Ralph J. Faudree, Richard H. Schelp
1974	J	`jnl`	All Ramsey numbers for cycles in graphs. Discret. Math. Ralph J. Faudree, Richard H. Schelp
1974	J	`jnl`	Path-cycle Ramsey numbers. Discret. Math. Ralph J. Faudree, S. L. Lawrence, Torrence D. Parsons, Richard H. Schelp
1973	J	`jnl`	Theory of path length distributions I. Discret. Math. Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp