Items where Author is "Schelp, RH"
 | Up a level |
Number of items: 11.
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2004 | Balister, PN and Győri, E. and Lehel, Jenő and Schelp, RH Longest paths in circular arc graphs | Article | |
| 2001 | Faudree, RJ and Flandrin, E. and Jacobson, MS and Lehel, Jenő and Schelp, RH Even cycles in graphs with many odd | Article | |
| 1998 | Chen, G. and Gyárfás, András and Schelp, RH Verte colorings with a distance restriction | Article | |
| 1998 | Gyárfás, András and Schelp, RH A communication problem and directed triple systems | Article | |
| 1997 | Gyárfás, András and Jagota, A. and Schelp, RH Monochromatic path covers in nearly complete graphs | Article | |
| 1997 | Chen, G. and Erdős, PL and Gyárfás, András and Schelp, RH A class of edge critical 4-chromatic graphs | Article | |
| 1996 | Faudree, RJ and Gyárfás, András and Schelp, RH An edge coloring problem for graph products | Article | |
| 1994 | Faudree, RJ and Schelp, RH and Lesniak, L. and Gyárfás, András and Lehel, Jenő On the rotation distance of graphs | Article | |
| 1993 | Faudree, RJ and Gyárfás, András and Lesniak, L. and Schelp, RH Rainbow coloring the cube | Article | |
| 1992 | Gyárfás, András and Jacobson, MS and Kinch, L. and Lehel, Jenő and Schelp, RH Irregularity strength of uniform hypergraphs | Article | |
| 1992 | Csaba, L. and Faudree, RJ and Gyárfás, András and Lehel, Jenő and Schelp, RH Networks communicating for each pairing of terminals | Article |
