2008 | ||
---|---|---|
57 | EE | Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp: Connected graphs without long paths. Discrete Mathematics 308(19): 4487-4494 (2008) |
56 | EE | Vladimir Nikiforov, Richard H. Schelp: Cycles and stability. J. Comb. Theory, Ser. B 98(1): 69-84 (2008) |
55 | EE | András Gyárfás, Jenö Lehel, Gábor N. Sárközy, Richard H. Schelp: Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs. J. Comb. Theory, Ser. B 98(2): 342-358 (2008) |
2007 | ||
54 | EE | Guantao Chen, Richard H. Schelp: Decomposition of bipartite graphs into special subgraphs. Discrete Applied Mathematics 155(3): 400-404 (2007) |
53 | EE | Vladimir Nikiforov, Richard H. Schelp: Making the components of a graph k-connected. Discrete Applied Mathematics 155(3): 410-415 (2007) |
52 | EE | Ralph J. Faudree, Richard H. Schelp, Akira Saito, Ingo Schiermeyer: Degree conditions for hamiltonicity: Counting the number of missing edges. Discrete Mathematics 307(7-8): 873-877 (2007) |
51 | EE | András Gyárfás, Jenö Lehel, Richard H. Schelp: Finding a monochromatic subgraph or a rainbow path. Journal of Graph Theory 54(1): 1-12 (2007) |
50 | EE | Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp: Adjacent Vertex Distinguishing Edge-Colorings. SIAM J. Discrete Math. 21(1): 237-250 (2007) |
2006 | ||
49 | EE | Paul N. Balister, András Gyárfás, Jenö Lehel, Richard H. Schelp: Mono-multi bipartite Ramsey numbers, designs, and matrices. J. Comb. Theory, Ser. A 113(1): 101-112 (2006) |
48 | EE | Paul N. Balister, Jenö Lehel, Richard H. Schelp: Ramsey unsaturated and saturated graphs. Journal of Graph Theory 51(1): 22-32 (2006) |
47 | EE | Vladimir Nikiforov, Richard H. Schelp: Cycle lengths in graphs with large minimum degree. Journal of Graph Theory 52(2): 157-170 (2006) |
2004 | ||
46 | Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp: Longest Paths in Circular Arc Graphs. Combinatorics, Probability & Computing 13(3): 311-317 (2004) | |
45 | EE | Paul N. Balister, Alexandr V. Kostochka, Hao Li, Richard H. Schelp: Balanced edge colorings. J. Comb. Theory, Ser. B 90(1): 3-20 (2004) |
44 | EE | Vladimir Nikiforov, Richard H. Schelp: Cycles and paths in graphs with large minimal degree. Journal of Graph Theory 47(1): 39-52 (2004) |
2003 | ||
43 | EE | Ralph J. Faudree, Zdenek Ryjácek, Richard H. Schelp: On local and global independence numbers of a graph. Discrete Applied Mathematics 132(1-3): 79-84 (2003) |
42 | EE | Rao Li, Richard H. Schelp: Every 3-connected distance claw-free graph is Hamilton-connected. Discrete Mathematics 268(1-3): 185-197 (2003) |
41 | EE | Ervin Györi, Vladimir Nikiforov, Richard H. Schelp: Nearly bipartite graphs. Discrete Mathematics 272(2-3): 187-196 (2003) |
40 | EE | Paul Balister, Béla Bollobás, Oliver Riordan, Richard H. Schelp: Graphs with large maximum degree containing no odd cycles of a given length. J. Comb. Theory, Ser. B 87(2): 366-373 (2003) |
2002 | ||
39 | EE | Rao Li, Richard H. Schelp: Hamiltonicity of {K1, 4, K1, 4+e}-free graphs. Discrete Mathematics 245(1-3): 195-202 (2002) |
38 | EE | Béla Bollobás, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: Random induced graphs. Discrete Mathematics 248(1-3): 249-254 (2002) |
37 | EE | Ervin Györi, Richard H. Schelp: Two-edge colorings of graphs with bounded degree in both colors. Discrete Mathematics 249(1-3): 105-110 (2002) |
36 | EE | Paul N. Balister, Béla Bollobás, Richard H. Schelp: Vertex distinguishing colorings of graphs with Delta(G)=2. Discrete Mathematics 252(1-3): 17-29 (2002) |
2001 | ||
35 | EE | Zdenek Ryjácek, Akira Saito, Richard H. Schelp: Claw-free graphs with complete closure. Discrete Mathematics 236(1-3): 325-338 (2001) |
34 | Béla Bollobás, Jair Donadelli, Yoshiharu Kohayakawa, Richard H. Schelp: Ramsey minimal graphs. J. Braz. Comp. Soc. 7(3): 27-37 (2001) | |
2000 | ||
33 | EE | Rao Li, Richard H. Schelp: Some hamiltonian properties of L1-graphs. Discrete Mathematics 223(1-3): 207-216 (2000) |
32 | EE | Béla Bollobás, Alexandr V. Kostochka, Richard H. Schelp: Local and Mean Ramsey Numbers for Trees. J. Comb. Theory, Ser. B 79(1): 100-103 (2000) |
1999 | ||
31 | EE | Béla Bollobás, Oliver Riordan, Zdenek Ryjácek, Akira Saito, Richard H. Schelp: Closure and Hamiltonian-connectivity of claw-free graphs. Discrete Mathematics 195(1-3): 67-80 (1999) |
30 | EE | Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: The number of cycle lengths in graphs of given minimum degree and girth. Discrete Mathematics 200(1-3): 55-60 (1999) |
1998 | ||
29 | Richard H. Schelp, Andrew Thomason: A Remark on the Number of Complete and Empty Subgraphs. Combinatorics, Probability & Computing 7(2): 217-219 (1998) | |
28 | EE | András Gyárfás, Richard H. Schelp: A Communication Problem and Directed Triple Systems. Discrete Applied Mathematics 85(2): 139-147 (1998) |
27 | EE | Guantao Chen, András Gyárfás, Richard H. Schelp: Vertex colorings with a distance restriction. Discrete Mathematics 191(1-3): 65-82 (1998) |
1997 | ||
26 | EE | Guantao Chen, Richard H. Schelp, Warren E. Shreve: A special k-coloring for a connected k-chromatic graph. Discrete Mathematics 170(1-3): 231-236 (1997) |
25 | EE | Guantao Chen, Richard H. Schelp, Warren E. Shreve: A New Game Chromatic Number. Eur. J. Comb. 18(1): 1-9 (1997) |
1996 | ||
24 | EE | Paul Erdös, Talmage James Reid, Richard H. Schelp, William Staton: Sizes of graphs with induced subgraphs of large maximum degree. Discrete Mathematics 158(1-3): 283-286 (1996) |
23 | EE | Odile Favaron, Hao Li, Richard H. Schelp: Strong edge colorings of graphs. Discrete Mathematics 159(1-3): 103-109 (1996) |
1995 | ||
22 | EE | Paul Erdös, Ralph J. Faudree, Talmage James Reid, Richard H. Schelp, William Staton: Degree sequence and independence in K(4)-free graphs. Discrete Mathematics 141(1-3): 285-290 (1995) |
1994 | ||
21 | EE | Ralph J. Faudree, Richard H. Schelp, Linda M. Lesniak, András Gyárfás, Jenö Lehel: On the rotation distance of graphs. Discrete Mathematics 126(1-3): 121-135 (1994) |
20 | EE | Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: A local density condition for triangles. Discrete Mathematics 127(1-3): 153-161 (1994) |
1993 | ||
19 | Guantao Chen, Richard H. Schelp: Ramsey Problems With Bounded Degree Spread. Combinatorics, Probability & Computing 2: 263-269 (1993) | |
18 | Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: Ramsey Size Linear Graphs. Combinatorics, Probability & Computing 2: 389-399 (1993) | |
17 | EE | P. Bedrossian, Guantao Chen, Richard H. Schelp: A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness. Discrete Mathematics 115(1-3): 39-50 (1993) |
16 | EE | Paul Erdös, Guantao Chen, Cecil C. Rousseau, Richard H. Schelp: Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs. Eur. J. Comb. 14(3): 183-189 (1993) |
15 | EE | Guantao Chen, Richard H. Schelp: Graphs with Linearly Bounded Ramsey Numbers. J. Comb. Theory, Ser. B 57(1): 138-149 (1993) |
1990 | ||
14 | EE | Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: Subgraphs of minimal degree k. Discrete Mathematics 85(1): 53-58 (1990) |
1989 | ||
13 | EE | Ralph J. Faudree, Richard H. Schelp, Michael S. Jacobson, Jenö Lehel: Irregular networks, regular graphs and integer matrices with distinct row and column sums. Discrete Mathematics 76(3): 223-240 (1989) |
12 | EE | Ralph J. Faudree, András Gyárfás, Richard H. Schelp, Zsolt Tuza: Induced matchings in bipartite graphs. Discrete Mathematics 78(1-2): 83-87 (1989) |
11 | EE | Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp: Neighborhood unions and hamiltonian properties in graphs. J. Comb. Theory, Ser. B 47(1): 1-9 (1989) |
1988 | ||
10 | EE | Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: Extremal theory and bipartite graph-tree Ramsey numbers. Discrete Mathematics 72(1-3): 103-112 (1988) |
9 | EE | Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: Small order graph-tree Ramsey numbers. Discrete Mathematics 72(1-3): 119-127 (1988) |
1987 | ||
8 | EE | Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: A Ramsey problem of Harary on graphs with prescribed size. Discrete Mathematics 67(3): 227-233 (1987) |
7 | EE | András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza: Local k-colorings of graphs and hypergraphs. J. Comb. Theory, Ser. B 43(2): 127-139 (1987) |
1986 | ||
6 | Ralph J. Faudree, Richard H. Schelp, Vera T. Sós: Some intersection theorems on two valued functions. Combinatorica 6(4): 327-333 (1986) | |
1985 | ||
5 | Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: Multipartite graph - space graph Ramsey numbers. Combinatorica 5(4): 311-318 (1985) | |
1982 | ||
4 | EE | Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: Ramsey-minimal graphs for forests. Discrete Mathematics 38(1): 23-32 (1982) |
3 | EE | Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: Graphs with certain families of spanning trees. J. Comb. Theory, Ser. B 32(2): 162-170 (1982) |
1981 | ||
2 | EE | Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: Ramsey-minimal graphs for star-forests. Discrete Mathematics 33(3): 227-237 (1981) |
1980 | ||
1 | EE | Ralph J. Faudree, Richard H. Schelp, J. Sheehan: Ramsey numbers for matchings. Discrete Mathematics 32(2): 105-123 (1980) |