Richard H. Schelp

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

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



In proceedings 
PhD thesis 


Online presence:



Decompositions of graphs into cycles with chords.
J. Comb. Theory B, 2018

An Extremal Problem Resulting in Many Paths.
Ars Comb., 2014

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

Some Ramsey-Turán type problems and related questions.
Discret. Math., 2012

Coloring vertices and edges of a graph by nonempty subsets of a set.
Eur. J. Comb., 2011

Long rainbow cycles in proper edge-colorings of complete graphs.
Australas. J Comb., 2011

A new class of Ramsey-Turán problems.
Discret. Math., 2010

Multipartite Ramsey numbers for odd cycles.
J. Graph Theory, 2009

Cycles and stability.
J. Comb. Theory B, 2008

Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs.
J. Comb. Theory B, 2008

Connected graphs without long paths.
Discret. Math., 2008

Adjacent Vertex Distinguishing Edge-Colorings.
SIAM J. Discret. Math., 2007

Finding a monochromatic subgraph or a rainbow path.
J. Graph Theory, 2007

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

Making the components of a graph k-connected.
Discret. Appl. Math., 2007

Decomposition of bipartite graphs into special subgraphs.
Discret. Appl. Math., 2007

Cycle lengths in graphs with large minimum degree.
J. Graph Theory, 2006

Ramsey unsaturated and saturated graphs.
J. Graph Theory, 2006

Mono-multi bipartite Ramsey numbers, designs, and matrices.
J. Comb. Theory A, 2006

Cycles and paths in graphs with large minimal degree.
J. Graph Theory, 2004

Balanced edge colorings.
J. Comb. Theory B, 2004

Longest Paths in Circular Arc Graphs.
Comb. Probab. Comput., 2004

Contractibility techniques as a closure concept.
J. Graph Theory, 2003

Vertex-distinguishing edge colorings of graphs.
J. Graph Theory, 2003

Graphs with large maximum degree containing no odd cycles of a given length.
J. Comb. Theory B, 2003

Every 3-connected distance claw-free graph is Hamilton-connected.
Discret. Math., 2003

Nearly bipartite graphs.
Discret. Math., 2003

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

A note on Ramsey size-linear graphs.
J. Graph Theory, 2002

Three edge-coloring conjectures.
Discuss. Math. Graph Theory, 2002

Hamiltonicity of {K<sub>1, 4</sub>, K<sub>1, 4</sub>+<i>e</i>}-free graphs.
Discret. Math., 2002

Two-edge colorings of graphs with bounded degree in both colors.
Discret. Math., 2002

Random induced graphs.
Discret. Math., 2002

Vertex distinguishing colorings of graphs with Delta(G)=2.
Discret. Math., 2002

Relative length of longest paths and cycles in 3-connected graphs.
J. Graph Theory, 2001

Ramsey minimal graphs.
J. Braz. Comput. Soc., 2001

Claw-free graphs with complete closure.
Discret. Math., 2001

On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs.
J. Graph Theory, 2000

Local and Mean Ramsey Numbers for Trees.
J. Comb. Theory B, 2000

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

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

Some hamiltonian properties of <i>L</i><sub>1</sub>-graphs.
Discret. Math., 2000

Closure, 2-factors, and cycle coverings in claw-free graphs.
J. Graph Theory, 1999

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

Closure and Hamiltonian-connectivity of claw-free graphs.
Discret. Math., 1999

Vertex colorings with a distance restriction.
Discret. Math., 1998

A Communication Problem and Directed Triple Systems.
Discret. Appl. Math., 1998

A Remark on the Number of Complete and Empty Subgraphs.
Comb. Probab. Comput., 1998

Local and mean <i>k</i>-Ramsey numbers for complete graphs.
J. Graph Theory, 1997

Graphs with given odd sets.
J. Graph Theory, 1997

Special monochromatic trees in two-colored complete graphs.
J. Graph Theory, 1997

Vertex-distinguishing proper edge-colorings.
J. Graph Theory, 1997

A Class of Edge Critical 4-Chromatic Graphs.
Graphs Comb., 1997

A New Game Chromatic Number.
Eur. J. Comb., 1997

A special k-coloring for a connected k-chromatic graph.
Discret. Math., 1997

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

Strong edge colorings of graphs.
Discret. Math., 1996

Sizes of graphs with induced subgraphs of large maximum degree.
Discret. Math., 1996

Hamiltonicity for <i>K</i><sub>1, r</sub>-free graphs.
J. Graph Theory, 1995

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

The drawing Ramsey number Dr(K<sub>n</sub>).
Australas. J Comb., 1995

Vertex disjoint cycles for star free graphs.
Australas. J Comb., 1995

Local edge colorings that are global.
J. Graph Theory, 1994

Hamiltonian graphs with neighborhood intersections.
J. Graph Theory, 1994

Neighborhood unions and the cycle cover number of a graph.
J. Graph Theory, 1994

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

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

Rainbow coloring the cube.
J. Graph Theory, 1993

Graphs with Linearly Bounded Ramsey Numbers.
J. Comb. Theory B, 1993

Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs.
Eur. J. Comb., 1993

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

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

Ramsey Problems With Bounded Degree Spread.
Comb. Probab. Comput., 1993

Networks communicating for each pairing of terminals.
Networks, 1992

Hamiltonian graphs involving distances.
J. Graph Theory, 1992

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

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

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

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

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

Intersection Theorems for t-Valued Functions.
Eur. J. Comb., 1988

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

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

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

Local <i>k</i>-colorings of graphs and hypergraphs.
J. Comb. Theory B, 1987

Ramsey numbers for local colorings.
Graphs Comb., 1987

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

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

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

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

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

An extremal problem for paths in bipartite graphs.
J. Graph Theory, 1984

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

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

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

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

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

Ramsey numbers for matchings.
Discret. Math., 1980

Some connected ramsey numbers.
J. Graph Theory, 1978

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

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

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

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

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