1990
[46] Problem 115. Discrete Math. 79 (1989-90) 109-110.
[47] A Simple lower bound for Edge Covering by Cliques.
Discrete Math. 85 (1990) 103-104. MR ??
[48] The maximum number of edges in $2k\sb2$-free graphs
of bounded Degree. Discrete Math. 81 (1990) 129-135
(with F.R.K.Chung, W.T.Trotter and Zs.Tuza). MR 91c, 05098.
1991
[49] Odd Cycles in graphs of given minimum degree. Proceedings
of the sixth Kalamazoo Conference. Graph Theory Combinatorics and
its Applications. John Wiley 1991, 407-418 (with
P.Erdős, R.J.Faudree and R.H.Schelp). MR 91c, 05098.
[50] Vertex Coverings by monochromatic Cycles and Trees.
Journal of Comb. Th. B 51 (1991) 90-95 (with P.Erdős and
L.Pyber). MR ??
[51] Monochromatic Coverings in Colored Complete graphs.
Congressus Numerantium 71 (1990) 29-38 (with P.Erdős,
R.J.Faudree, R.J.Gould, C.C.Rousseau, R.H.Schelp). MR
91a, 05043.
[52] The Strong Chromatic Index of Graphs. Ars Combinatoria
29B (1990) 205-211 (with R.J.Faudree, R.H.Schelp, Zs.Tuza).
MR 97f:05066
[53] First Fit and On-line chromatic number of Families of
Graphs. Ars Combinatoria 29C (1990) 160-167 (with J.Lehel).
MR 97f: 05067
[54] Effective on-line Coloring of $P\sb5$-free Graphs.
Combinatorica 11 (1991) 181-184 (with J.Lehel). MR 92h, 05055.
[55] Covering $t$-element subsets by Partitions. European
Journal of Combinatorics 12 (1991) 483-489 (with Z.Füredi).
MR 92i, 05022.
1992
[56] Three-regular Path Pairable Graphs. Graphs and Combinatorics
8 (1992) 45-52 (with R.J.Faudree and J.Lehel). MR 92m, 05109.
[57] Graphs with $k$ odd Cycle lengths. Discrete Math. 103
(1992) 41-48. MR ??
[58] Irregularity Strength of the Grid. Journal of Graph Theory
16 (1992) 355-374 (with J.Dinitz and D.Garnick). MR 93i, 05074.
[59] Variations on the Ramsey Theme (in Hungarian). Dr.Sci.Acad.
Thesis. Matematikai Lapok (1992) 1-24.
[60] Projective Spaces and colorings of $K\sb{m}\times K\sb{n}$.
Coll. Math. Soc. J.Bolyai 60. Sets Graphs and Numbers (1991)
273-278 (with R.J.Faudree and T.Szőnyi) MR 94a, 05069
[61] Irregularity Strength of Uniform Hypergraphs. Journal of
Combinatorial Methods and Combinatorial Computation 11 (1992)
161-172 (with M.S.Jacobson, L.Kinch, J.Lehel, R.H.Schelp).
[62] Networks Communicating for each Pairing of Terminals.
Networks 22 (1992) 615-626 (with L.Csaba, R.J.Faudree,
J.Lehel, R.H.Schelp).
1993
[63] Minimal Path Pairable Graphs. Congressus Numerantium
88 (1992) 111-128 (with R.J.Faudree and J.Lehel). MR 93j,
05085.
[64] On-line Graph Coloring and Finite Basis Problems.
Combinatorics: Paul Erdős is Eighty, Volume 1. Bolyai
Society Math. Studies (1993) 207-214 (with Z.Király and
J.Lehel).
[65] Rainbow Coloring of the Cube. Journal of Graph Theory
17 (1993) 607-612 (with R.J.Faudree, L.Lesniak and R.H. Schelp).
MR 94g,05034
[66] On the Rotation Distance of Graphs. Discrete Mathematics
126 (1994) 121-135 (with R.J.Faudree, J.Lehel, L.Lesniak,
R.H.Schelp). MR 95d,05106
1994
[67] On a Ramsey Type problem of Shelah. Bolyai Soc. Math. Studies
3. (Extremal Problems for Finite Sets, 1991) pp 283-287
MR 96a: 05105
[68] Independent Transversals in Sparse Partite Hypergraphs.
Combinatorics, Probability and Computing 3 (1994) 293-296.
(with P.Erdős and T. Luczak)
MR 96b: 05126
1995
[69] Linear Sets with five distinct differences among any four
elements. Journal of Comb. Theory B 64 (1995) 108-118. (with J.Lehel)
[70] Vertex Covering with Monochromatic Paths, Mathematica Pannonica 6/1 (1995) 7-10. (With P.Erdős)
MR 96c:05127
1996
[71] Minimal Non-Neighborhood-Perfect Graphs, Journal of
Graph Theory, 21 (1996) 55-66. (with D.Kratsch, F.Maffray,
J.Lehel).
[72] Monochromatic Path Covers, Congressus Numerantium 109 (1995)
201-202.
[73] Multitrack Interval Graphs, Congressus Numerantium 109
(1995) 109-116. (with Douglas West)
[74] Graphs in which each $C_4$ spans $K_4$, (with P.Erdős and
T.Luczak), Discrete Math. 154 (1996) 263-268
MR 97a: 05121
[75] Endpoint Extendable Paths in Tournaments (with R.J.Faudree)
Journal of Graph Theory 23 (1996) 303-307 MR 97f: 05078
[76] An Edge Coloring Problem for Graph Products (with R.J.Faudree and R.H.Schelp) Journal of Graph Theory 23 (1996)
297-302 MR 97g: 05075
1997
[77] Fruit Salad, Electronic Journal of Combinatorics 4(1997),R8.
MR 98a: 05087
[78] Reflections on a problem of Erd\H os and Hajnal, in
"The Mathematics of Paul Erdős", R.L.Graham, J.Nesetril
(editors). Algorithms and Combinatorics, vols. 13-14.
Springer 1997. (Vol II. 93-98.) MR 98a: 05086
[79] A Class of Edge Critical 4-chromatic Graphs (with G.Chen,
P.Erd\H os, R.H.Schelp), Graphs and Combinatorics 13 (1997)
139-146. MR 98c: 05057
[80] On-line $3$-chromatic graphs II. Critical graphs.
(with J.Lehel, Z.Király) Discrete Mathematics 177 (1997)
99-122.
[81] The size of the largest bipartite subgraphs. (with
P.Erdős, Y.Kohayakawa) Discrete Mathematics 177 (1997)
267-271. MR 98j: 05084
[82] Path Matchings in Graphs (with R.Faudree),
Congressus Numerantium 120, (1996) 83-96.
MR 97j: 05047
1998
[83] Monochromatic Path Covers in Nearly Complete Graphs
(with A.Jagota and R.H.Schelp) JCMCC 25 (1997)129-144.
MR 98h: 05149
[84] Generalized Split Graphs and Ramsey numbers, Journal of
Combinatorial Theory, A. 81 (1998) 255-261 MR 98h: 05137
[85] 2-Partition-Transitive Tournaments (with B.Guiduli, S.Thomassé, P.Weidl) , Journal of Comb. Th. B.
72 (1998) 181-196. MR 99c: 05079
[86] Nonsymmetric Party Problems, Journal of Graph Theory
28 (1998)43-47. MR 99f: 05079
[87] A variant of the classical Ramsey problem
(with Paul Erdős), Combinatorica 17 (1997) 459-467.
MR 99h: 05090
[88] A Communication problem and directed triple systems
(with R.H.Schelp), Discrete Applied Math. 85 (1998) 139-147.
MR 99f: 05090
[89] Vertex colorings with a distance restriction (with
R.H.Schelp, G.Chen) Discrete Math. 191 (1998) 65-82.
MR 99j: 05067
[90] How to decrease the diameter of triangle-free graphs
(with P.Erdős, M.Ruszinkó) Combinatorica 18 (1998)
493-501. MR2000j: 05061
1999
[91] Path-pairable graphs (with Faudree and Lehel)
JCMCC 29 (1999) 145-157. MR 99j: 05120
[92] Split and Balanced colorings of complete graphs
(with Erdős) Discrete Math. 200 (1999) 79-86.
MR 2000e: 05062
[93] Hypergraphs, Section 8.12 in CRC Handbook of Discrete
and Combinatorial Mathematics, CRC Press, 2000. 595-599.
[94] On-line $3$-chromatic graphs I. Triangle-free graphs
(with Lehel and Z. Király) SIAM J. on Discrete Mathematics 12
(1999) 385-411. MR2000i: 05C15
[95] Extremal problems for forbidden pairs that imply
Hamiltonicity (with R.Faudree) Discussiones Math. Graph
Theory 19 (1999) 13-29. MR 2000h: 05141
