Richard H. Schelp

According to our database, Richard H. Schelp authored at least 104 papers between 1973 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of one.

2018

Decompositions of graphs into cycles with chords.

Paul Balister, Hao Li, Richard H. Schelp

J. Comb. Theory B, 2018

2014

An Extremal Problem Resulting in Many Paths.

Richard H. Schelp, Kiyoshi Yoshimoto

Ars Comb., 2014

2013

Problems in Graph Theory from Memphis.

Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Proceedings of the Mathematics of Paul Erdős II, 2013

2012

Some Ramsey-Turán type problems and related questions.

Richard H. Schelp

Discret. Math., 2012

2011

Coloring vertices and edges of a graph by nonempty subsets of a set.

Paul N. Balister, Ervin Györi, Richard H. Schelp

Eur. J. Comb., 2011

Long rainbow cycles in proper edge-colorings of complete graphs.

András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Richard H. Schelp

Australas. J Comb., 2011

2010

A new class of Ramsey-Turán problems.

H. Li, Vladimir Nikiforov, Richard H. Schelp

Discret. Math., 2010

2009

Multipartite Ramsey numbers for odd cycles.

András Gyárfás, Gábor N. Sárközy, Richard H. Schelp

J. Graph Theory, 2009

2008

Cycles and stability.

Vladimir Nikiforov, Richard H. Schelp

J. Comb. Theory B, 2008

Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs.

András Gyárfás, Jenö Lehel, Gábor N. Sárközy, Richard H. Schelp

J. Comb. Theory B, 2008

Connected graphs without long paths.

Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp

Discret. Math., 2008

2007

Adjacent Vertex Distinguishing Edge-Colorings.

Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp

SIAM J. Discret. Math., 2007

Finding a monochromatic subgraph or a rainbow path.

András Gyárfás, Jenö Lehel, Richard H. Schelp

J. Graph Theory, 2007

Degree conditions for hamiltonicity: Counting the number of missing edges.

Ralph J. Faudree, Richard H. Schelp, Akira Saito, Ingo Schiermeyer

Discret. Math., 2007

Making the components of a graph k-connected.

Vladimir Nikiforov, Richard H. Schelp

Discret. Appl. Math., 2007

Decomposition of bipartite graphs into special subgraphs.

Guantao Chen, Richard H. Schelp

Discret. Appl. Math., 2007

2006

Cycle lengths in graphs with large minimum degree.

Vladimir Nikiforov, Richard H. Schelp

J. Graph Theory, 2006

Ramsey unsaturated and saturated graphs.

Paul N. Balister, Jenö Lehel, Richard H. Schelp

J. Graph Theory, 2006

Mono-multi bipartite Ramsey numbers, designs, and matrices.

Paul N. Balister, András Gyárfás, Jenö Lehel, Richard H. Schelp

J. Comb. Theory A, 2006

2004

Cycles and paths in graphs with large minimal degree.

Vladimir Nikiforov, Richard H. Schelp

J. Graph Theory, 2004

Balanced edge colorings.

Paul N. Balister, Alexandr V. Kostochka, Hao Li, Richard H. Schelp

J. Comb. Theory B, 2004

Longest Paths in Circular Arc Graphs.

Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp

Comb. Probab. Comput., 2004

2003

Contractibility techniques as a closure concept.

Zdenek Ryjácek, Richard H. Schelp

J. Graph Theory, 2003

Vertex-distinguishing edge colorings of graphs.

Paul N. Balister, O. M. Riordan, Richard H. Schelp

J. Graph Theory, 2003

Graphs with large maximum degree containing no odd cycles of a given length.

Paul Balister, Béla Bollobás, Oliver Riordan, Richard H. Schelp

J. Comb. Theory B, 2003

Every 3-connected distance claw-free graph is Hamilton-connected.

Rao Li, Richard H. Schelp

Discret. Math., 2003

Nearly bipartite graphs.

Ervin Györi, Vladimir Nikiforov, Richard H. Schelp

Discret. Math., 2003

On local and global independence numbers of a graph.

Ralph J. Faudree, Zdenek Ryjácek, Richard H. Schelp

Discret. Appl. Math., 2003

2002

A note on Ramsey size-linear graphs.

Paul N. Balister, Richard H. Schelp, Miklós Simonovits

J. Graph Theory, 2002

Three edge-coloring conjectures.

Richard H. Schelp

Discuss. Math. Graph Theory, 2002

Hamiltonicity of {K_{1, 4}, K_{1, 4}+<i>e</i>}-free graphs.

Rao Li, Richard H. Schelp

Discret. Math., 2002

Two-edge colorings of graphs with bounded degree in both colors.

Ervin Györi, Richard H. Schelp

Discret. Math., 2002

Random induced graphs.

Béla Bollobás, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Discret. Math., 2002

Vertex distinguishing colorings of graphs with Delta(G)=2.

Paul N. Balister, Béla Bollobás, Richard H. Schelp

Discret. Math., 2002

2001

Relative length of longest paths and cycles in 3-connected graphs.

Rao Li, Akira Saito, Richard H. Schelp

J. Graph Theory, 2001

Ramsey minimal graphs.

Béla Bollobás, Jair Donadelli, Yoshiharu Kohayakawa, Richard H. Schelp

J. Braz. Comput. Soc., 2001

Claw-free graphs with complete closure.

Zdenek Ryjácek, Akira Saito, Richard H. Schelp

Discret. Math., 2001

2000

On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs.

Richard H. Schelp, Andrew Thomason

J. Graph Theory, 2000

Local and Mean Ramsey Numbers for Trees.

Béla Bollobás, Alexandr V. Kostochka, Richard H. Schelp

J. Comb. Theory B, 2000

Even Cycles in Graphs with Many Odd Cycles.

Ralph J. Faudree, Evelyne Flandrin, Michael S. Jacobson, Jeno Lehel, Richard H. Schelp

Graphs Comb., 2000

Vertex-Disjoint Cycles Containing Specified Edges.

Yoshimi Egawa, Ralph J. Faudree, Ervin Györi, Yoshiyasu Ishigami, Richard H. Schelp, Hong Wang

Graphs Comb., 2000

Some hamiltonian properties of <i>L</i>₁-graphs.

Rao Li, Richard H. Schelp

Discret. Math., 2000

1999

Closure, 2-factors, and cycle coverings in claw-free graphs.

Zdenek Ryjácek, Akira Saito, Richard H. Schelp

J. Graph Theory, 1999

The number of cycle lengths in graphs of given minimum degree and girth.

Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Discret. Math., 1999

Closure and Hamiltonian-connectivity of claw-free graphs.

Béla Bollobás, Oliver Riordan, Zdenek Ryjácek, Akira Saito, Richard H. Schelp

Discret. Math., 1999

1998

Vertex colorings with a distance restriction.

Guantao Chen, András Gyárfás, Richard H. Schelp

Discret. Math., 1998

A Communication Problem and Directed Triple Systems.

András Gyárfás, Richard H. Schelp

Discret. Appl. Math., 1998

A Remark on the Number of Complete and Empty Subgraphs.

Richard H. Schelp, Andrew Thomason

Comb. Probab. Comput., 1998

1997

Local and mean <i>k</i>-Ramsey numbers for complete graphs.

Richard H. Schelp

J. Graph Theory, 1997

Graphs with given odd sets.

Guantao Chen, Richard H. Schelp, Lubomír Soltés

J. Graph Theory, 1997

Special monochromatic trees in two-colored complete graphs.

Guantao Chen, Richard H. Schelp, Lubomír Soltés

J. Graph Theory, 1997

Vertex-distinguishing proper edge-colorings.

Anita C. Burris, Richard H. Schelp

J. Graph Theory, 1997

A Class of Edge Critical 4-Chromatic Graphs.

Guantao Chen, Paul Erdös, András Gyárfás, Richard H. Schelp

Graphs Comb., 1997

A New Game Chromatic Number.

Guantao Chen, Richard H. Schelp, Warren E. Shreve

Eur. J. Comb., 1997

A special k-coloring for a connected k-chromatic graph.

Guantao Chen, Richard H. Schelp, Warren E. Shreve

Discret. Math., 1997

1996

An edge coloring problem for graph products.

Ralph J. Faudree, András Gyárfás, Richard H. Schelp

J. Graph Theory, 1996

Strong edge colorings of graphs.

Odile Favaron, Hao Li, Richard H. Schelp

Discret. Math., 1996

Sizes of graphs with induced subgraphs of large maximum degree.

Paul Erdös, Talmage James Reid, Richard H. Schelp, William Staton

Discret. Math., 1996

1995

Hamiltonicity for <i>K</i>_{1, r}-free graphs.

Guantao Chen, Richard H. Schelp

J. Graph Theory, 1995

Degree sequence and independence in K(4)-free graphs.

Paul Erdös, Ralph J. Faudree, Talmage James Reid, Richard H. Schelp, William Staton

Discret. Math., 1995

The drawing Ramsey number Dr(K_n).

Heiko Harborth, Ingrid Mengersen, Richard H. Schelp

Australas. J Comb., 1995

Vertex disjoint cycles for star free graphs.

Guantao Chen, Lisa R. Marcus, Richard H. Schelp

Australas. J Comb., 1995

1994

Local edge colorings that are global.

R. A. Clapsadle, Richard H. Schelp

J. Graph Theory, 1994

Hamiltonian graphs with neighborhood intersections.

Guantao Chen, Richard H. Schelp

J. Graph Theory, 1994

Neighborhood unions and the cycle cover number of a graph.

Guantao Chen, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp

J. Graph Theory, 1994

On the rotation distance of graphs.

Ralph J. Faudree, Richard H. Schelp, Linda M. Lesniak, András Gyárfás, Jenö Lehel

Discret. Math., 1994

A local density condition for triangles.

Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Discret. Math., 1994

1993

Rainbow coloring the cube.

Ralph J. Faudree, András Gyárfás, Linda M. Lesniak, Richard H. Schelp

J. Graph Theory, 1993

Graphs with Linearly Bounded Ramsey Numbers.

Guantao Chen, Richard H. Schelp

J. Comb. Theory B, 1993

Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs.

Paul Erdös, Guantao Chen, Cecil C. Rousseau, Richard H. Schelp

Eur. J. Comb., 1993

A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness.

P. Bedrossian, Guantao Chen, Richard H. Schelp

Discret. Math., 1993

Ramsey Size Linear Graphs.

Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Comb. Probab. Comput., 1993

Ramsey Problems With Bounded Degree Spread.

Guantao Chen, Richard H. Schelp

Comb. Probab. Comput., 1993

1992

Networks communicating for each pairing of terminals.

László Csaba, Ralph J. Faudree, András Gyárfás, Jenö Lehel, Richard H. Schelp

Networks, 1992

Hamiltonian graphs involving distances.

Guantao Chen, Richard H. Schelp

J. Graph Theory, 1992

1990

Subgraphs of minimal degree k.

Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Discret. Math., 1990

1989

Domination in colored complete graphs.

Paul Erdös, Ralph J. Faudree, András Gyárfás, Richard H. Schelp

J. Graph Theory, 1989

Neighborhood unions and hamiltonian properties in graphs.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp

J. Comb. Theory B, 1989

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

Ralph J. Faudree, Richard H. Schelp, Michael S. Jacobson, Jenö Lehel

Discret. Math., 1989

Induced matchings in bipartite graphs.

Ralph J. Faudree, András Gyárfás, Richard H. Schelp, Zsolt Tuza

Discret. Math., 1989

1988

Intersection Theorems for t-Valued Functions.

Richard H. Schelp, Miklós Simonovits, Vera T. Sós

Eur. J. Comb., 1988

Small order graph-tree Ramsey numbers.

Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Discret. Math., 1988

Extremal theory and bipartite graph-tree Ramsey numbers.

Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Discret. Math., 1988

1987

Extremal problems involving neighborhood unions.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp

J. Graph Theory, 1987

Local <i>k</i>-colorings of graphs and hypergraphs.

András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza

J. Comb. Theory B, 1987

Ramsey numbers for local colorings.

András Gyárfás, Jeno Lehel, Richard H. Schelp, Zsolt Tuza

Graphs Comb., 1987

Goodness of trees for generalized books.

Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp, Ronald J. Gould, Michael S. Jacobson

Graphs Comb., 1987

A Ramsey problem of Harary on graphs with prescribed size.

Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Discret. Math., 1987

1986

Some intersection theorems on two valued functions.

Ralph J. Faudree, Richard H. Schelp, Vera T. Sós

Comb., 1986

1985

On Graphs with Ramsey-Infinite Blocks.

Stefan A. Burr, Ralph J. Faudree, Richard H. Schelp

Eur. J. Comb., 1985

Multipartite graph - space graph Ramsey numbers.

Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Comb., 1985

1984

An extremal problem for paths in bipartite graphs.

András Gyárfás, Cecil C. Rousseau, Richard H. Schelp

J. Graph Theory, 1984

1983

On Ramsey numbers involving starlike multipartite graphs.

Stefan A. Burr, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

J. Graph Theory, 1983

1982

Graphs with certain families of spanning trees.

Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

J. Comb. Theory B, 1982

Ramsey-minimal graphs for forests.

Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Discret. Math., 1982

1981

Ramsey-minimal graphs for star-forests.

Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Discret. Math., 1981

1980

All triangle-graph ramsey numbers for connected graphs of order six.

Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

J. Graph Theory, 1980

Ramsey numbers for matchings.

Ralph J. Faudree, Richard H. Schelp, J. Sheehan

Discret. Math., 1980

1978

Some connected ramsey numbers.

Ralph J. Faudree, Richard H. Schelp

J. Graph Theory, 1978

On cycle - Complete graph ramsey numbers.

Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

J. Graph Theory, 1978

1976

Ramsey numbers for all linear forests.

Ralph J. Faudree, Richard H. Schelp

Discret. Math., 1976

1974

All Ramsey numbers for cycles in graphs.

Ralph J. Faudree, Richard H. Schelp

Discret. Math., 1974

Path-cycle Ramsey numbers.

Ralph J. Faudree, S. L. Lawrence, Torrence D. Parsons, Richard H. Schelp

Discret. Math., 1974

1973

Theory of path length distributions I.

Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Discret. Math., 1973