R. H. Schelp

From MaRDI portal
Person:185070

Available identifiers

zbMath Open schelp.richard-hDBLP22/5356WikidataQ7328913 ScholiaQ7328913MaRDI QIDQ185070

List of research outcomes





PublicationDate of PublicationType
Decompositions of graphs into cycles with chords2017-11-28Paper
https://portal.mardi4nfdi.de/entity/Q34475852015-10-27Paper
Some Ramsey-Turán type problems and related questions2012-07-04Paper
https://portal.mardi4nfdi.de/entity/Q31010002011-11-22Paper
Coloring vertices and edges of a graph by nonempty subsets of a set2011-04-08Paper
A new class of Ramsey-Turán problems2010-11-19Paper
Multipartite Ramsey numbers for odd cycles2009-06-16Paper
Connected graphs without long paths2008-09-04Paper
Adjacent Vertex Distinguishing Edge‐Colorings2008-03-28Paper
Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs2008-03-14Paper
Cycles and stability2007-12-10Paper
Degree conditions for Hamiltonicity: counting the number of missing edges2007-03-02Paper
Decomposition of bipartite graphs into special subgraphs2007-03-02Paper
Making the components of a graph \(k\)-connected2007-03-02Paper
Finding a monochromatic subgraph or a rainbow path2007-01-24Paper
Cycle lengths in graphs with large minimum degree2006-06-06Paper
Ramsey unsaturated and saturated graphs2006-03-24Paper
Mono-multi bipartite Ramsey numbers, designs, and matrices2006-03-16Paper
Book Ramsey Numbers and Quasi-Randomness2005-11-14Paper
Cycles and paths in graphs with large minimal degree2005-01-12Paper
Longest Paths in Circular Arc Graphs2004-09-24Paper
Balanced edge colorings.2004-03-15Paper
https://portal.mardi4nfdi.de/entity/Q44100102004-01-14Paper
On local and global independence numbers of a graph2003-12-04Paper
Nearly bipartite graphs2003-11-25Paper
Graphs with large maximum degree containing no odd cycles of a given length2003-08-25Paper
Every 3-connected distance claw-free graph is Hamilton-connected2003-07-29Paper
Contractibility techniques as a closure concept2003-05-22Paper
Three edge-coloring conjectures2003-05-06Paper
Vertex-distinguishing edge colorings of graphs2003-03-10Paper
Local and mean Ramsey numbers for trees2002-12-10Paper
Claw-free graphs with complete closure2002-10-24Paper
Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)2002-08-29Paper
A note on Ramsey size-linear graphs2002-08-25Paper
Relative length of longest paths and cycles in 3-connected graphs2002-08-08Paper
Random induced graphs2002-05-28Paper
Two-edge colorings of graphs with bounded degree in both colors2002-05-28Paper
Hamiltonicity of \(\{K_{1,4},K_{1,4}+e\}\)-free graphs2002-05-15Paper
Even cycles in graphs with many odd cycles2002-05-02Paper
Some hamiltonian properties of \(L_1\)-graphs2001-05-10Paper
Vertex-disjoint cycles containing specified edges2001-01-02Paper
Essentially Infinite Colourings of Graphs2000-12-13Paper
Vertex colorings with a distance restriction2000-11-02Paper
On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs2000-09-15Paper
The number of cycle lengths in graphs of given minimum degree and girth2000-04-10Paper
Closure, 2-factors, and cycle coverings in claw-free graphs2000-02-27Paper
Closure and Hamiltonian-connectivity of claw-free graphs1999-11-02Paper
A communication problem and directed triple systems1998-12-02Paper
A Remark on the Number of Complete and Empty Subgraphs1998-11-24Paper
A class of edge critical 4-chromatic graphs1998-02-16Paper
Vertex-distinguishing proper edge-colorings1998-01-07Paper
A new game chromatic number1997-08-31Paper
https://portal.mardi4nfdi.de/entity/Q43478851997-08-11Paper
https://portal.mardi4nfdi.de/entity/Q43478921997-08-11Paper
A special \(k\)-coloring for a connected \(k\)-chromatic graph1997-08-10Paper
Graphs with given odd sets1997-08-03Paper
Special monochromatic trees in two-colored complete graphs1997-07-27Paper
https://portal.mardi4nfdi.de/entity/Q52840791997-05-19Paper
Strong edge colorings of graphs1997-04-07Paper
An edge coloring problem for graph products1997-04-07Paper
Sizes of graphs with induced subgraphs of large maximum degree1997-03-23Paper
https://portal.mardi4nfdi.de/entity/Q56889941997-03-11Paper
Local and meank-Ramsey numbers for complete graphs1997-03-05Paper
Hamiltonicity for K1, r‐free graphs1996-08-13Paper
https://portal.mardi4nfdi.de/entity/Q48738211996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48738221996-04-22Paper
Degree sequence and independence in \(K(4)\)-free graphs1996-03-05Paper
https://portal.mardi4nfdi.de/entity/Q48427211995-11-29Paper
https://portal.mardi4nfdi.de/entity/Q48427201995-10-08Paper
Neighborhood unions and the cycle cover number of a graph1995-05-31Paper
Local edge colorings that are global1995-05-18Paper
https://portal.mardi4nfdi.de/entity/Q43131791995-03-12Paper
Hamiltonian graphs with neighborhood intersections1995-01-02Paper
Ramsey Problems with Bounded Degree Spread1994-09-11Paper
https://portal.mardi4nfdi.de/entity/Q42945871994-07-24Paper
https://portal.mardi4nfdi.de/entity/Q42945861994-07-24Paper
Rainbow coloring the cube1994-05-30Paper
https://portal.mardi4nfdi.de/entity/Q31392871994-05-05Paper
A local density condition for triangles1994-05-05Paper
Ramsey Size Linear Graphs1994-04-28Paper
Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs1993-08-25Paper
A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness1993-06-20Paper
https://portal.mardi4nfdi.de/entity/Q40282741993-03-28Paper
Networks communicating for each pairing of terminals1993-01-17Paper
Graphs with linearly bounded Ramsey numbers1993-01-01Paper
Hamiltonian graphs involving distances1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39766141992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39720001992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q57525901990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34900251990-01-01Paper
Subgraphs of minimal degree \(k\)1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34833111990-01-01Paper
Induced matchings in bipartite graphs1989-01-01Paper
Irregular networks, regular graphs and integer matrices with distinct row and column sums1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38340821989-01-01Paper
Neighbourhood unions and Hamiltonian properties in graphs1989-01-01Paper
Domination in colored complete graphs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38251061989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34752991989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34704991988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38047341988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38280271988-01-01Paper
Small order graph-tree Ramsey numbers1988-01-01Paper
Intersection theorems for t-valued functions1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47352101988-01-01Paper
Extremal theory and bipartite graph-tree Ramsey numbers1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34746701988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52030621988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37927191987-01-01Paper
Extremal problems involving neighborhood unions1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37942171987-01-01Paper
A Ramsey problem of Harary on graphs with prescribed size1987-01-01Paper
Goodness of trees for generalized books1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37896051987-01-01Paper
Some intersection theorems on two-valued functions1986-01-01Paper
Multipartite graph-sparse graph Ramsey numbers1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37014521985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32206321985-01-01Paper
On graphs with Ramsey-infinite blocks1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36884241985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36917041985-01-01Paper
An extremal problem for paths in bipartite graphs1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33382851984-01-01Paper
On Ramsey numbers involving starlike multipartite graphs1983-01-01Paper
Ramsey Numbers for the Pair Sparse Graph-Path or Cycle1982-01-01Paper
Ramsey-minimal graphs for forests1982-01-01Paper
Graphs with certain families of spanning trees1982-01-01Paper
Ramsey-minimal graphs for star-forests1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39227161981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39446341981-01-01Paper
Embedding graphs in their complements1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39266141981-01-01Paper
All triangle-graph ramsey numbers for connected graphs of order six1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38792691980-01-01Paper
Panarboreal graphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39076021980-01-01Paper
Ramsey numbers for matchings1980-01-01Paper
On cycle—Complete graph ramsey numbers1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41613541978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38693831978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41548871978-01-01Paper
Various length paths in graphs1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41686401978-01-01Paper
Some connected ramsey numbers1978-01-01Paper
The size Ramsey number1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38639211977-01-01Paper
The square of a block is strongly path connected1976-01-01Paper
Ramsey numbers for all linear forests1976-01-01Paper
Generalized Ramsey theory for multiple colors1976-01-01Paper
Path Ramsey numbers in multicolorings1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40687531975-01-01Paper
Path-path Ramsey type numbers for the complete bipartite graph1975-01-01Paper
The Entire Graph of a Bridgeless Connected Plane Graph is Panconnected1975-01-01Paper
A partial Baer *-semigroup of relations1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47740641975-01-01Paper
All Ramsey numbers for cycles in graphs1974-01-01Paper
Path connected graphs1974-01-01Paper
Path-cycle Ramsey numbers1974-01-01Paper
Theory of path length distributions. I1973-01-01Paper
A Partial Semigroup Approach to Partially Ordered Sets1972-01-01Paper
Coordinatization of Orthocomplemented and Orthomodular Posets1970-01-01Paper

Research outcomes over time

This page was built for person: R. H. Schelp