1980
[13] Still another triangle free infinite chromatic graph. Discrete Math. 30 (1980) 185. MR 81a, 05048.
[14] Induced Subtrees in graphs of large chromatic number
Discrete Math. 30 (1980) 235-244. (with E.Szemerédi and
Zs.Tuza). MR 81e, 05060.
1982
[15] Upper Bound on the order of $\tau$-critical
hypergraphs. Journal of Comb.Th.B. 33 (1982) 161-165
(with J.Lehel and Zs.Tuza). MR 84e, 05083.
1983
[16] Vertex coverings by Monochromatic paths and
Cycles. Journal of Graph Theory 7 (1983) 131-135. MR
84e, 05077.
[17] Hypergraph Families with bounded edge cover or
transversal number. Combinatorica 3 (1983) 351-358
(with J.Lehel). MR 85d, 05186.
1984
[18] An extremal Problem for paths in bipartite graphs.
Journal of Graph Theory 8 (1984) 83-95 (with R.H.Schelp
and C.C.Rousseau). MR 85d, 05144.
[19] The Structure of rectangle families dividing the
plane into maximum number of atoms. Discrete Math. 52
(1984) 177-198 (with J.Lehel and Zs.Tuza). MR 86g, 0525.
[20] On the Distribution of Cycle lengths in graphs.
Journal of Graph Theory 8 (1984) 441-462 (with J.Komlós
and E.Szemerédi). MR 85k, 05068.
1985
[21] On the sum of reciprocals of cycle lengths in sparse
graphs. Combinatorica 5 (1985) 41-52 (with H.J.Prőmel,
E.Szemerédi and B.Voight). MR 86m, 05059.
[22] How many atoms can be defined by boxes? Combinatorica
5 (1985) 193-204 (with J.Lehel and Zs.Tuza). MR 87f, 05040.
[23] Covering and Coloring problems for relatives of intervals.
Discrete Math. 55 (1985) 167-180 (with J.Lehel). MR 86j, 05110.
[24] On the Chromatic number of multiple interval graphs
and overlap graphs. Discrete Math. 55 (1985) 161-166.
MR 86k, 05052. Corrigendum in Discrete Math. 62 (1986)
333. MR 87k, 05079.
[25] Problems from the world surrounding Perfect Graphs.
MTA SZTAKI tanulmányok 177/1985 . MR 88a, 05066.
1987
[26] An upper bound on the Ramsey number of trees. Discrete
Math. 66 (1987) 309-310 (with Zs.Tuza). MR 88g, 05092.
[27] Ramsey Numbers for Local Colorings. Graphs and Combinatorics
3 (1987) 267-277 (with J.Lehel, R.H.Schelp, Zs.Tuza).
MR 88i, 05135.
[28] Local $k$-colorings of Graphs and Hypergraphs. Journal
of Comb. Theory B. 43 (1987) 127-139 (with J.Lehel,
J.Nesetril, V.Rödl, R.H.Schelp, Zs.Tuza). MR 88k, 05092.
[29] On $(n,k)$-colorings of Complete Graphs. Congressus
Numerantium 58 (1987) 127-139 (with J.Bierbrauer).
MR 89i, 05114.
[30] Graphs which have an Ascending Subgraph Decomposition.
Congressus Numerantium 59 (1987) 49-54 (with R.J.Faudree and
R.H.Schelp). MR 89d, 05142.
1988
[31] Cycles in Graphs without proper subgraphs of minimum
degree $3$. Ars Combinatoria 25 B (1988) 195-201 (with
P.Erdős, R.J.Faudree, R.H.Schelp). MR 89e, 05126.
[32] On a generalization of Transitivity for Digraphs.
Discrete Math. 69 (1988) 35-41 (with L.F.Kinch and
M.S.Jacobson). MR 89a, 05071.
[33] On-line and First Fit colorings of graphs. Journal
of Graph Theory 12 (1988) 217-227 (with J.Lehel).
MR 89c, 05037.
[34] Clumsy Packing of Dominoes. Discrete Math. 71 (1988)
33-46 (with J.Lehel and Zs.Tuza). MR 90c, 05060.
[35] The Irregurality Strength of $K\sb{m,m}$ is $4$ for
odd $m$. Discrete Math. 71 (1988) 273-274. MR 89f, 05100.
[36] Problems from the world surrrounding Perfect Graphs.
Zastowania Matematyki, Applicationes Mathematicae XIX.
3-4 (1987) 413-441. MR 05089.
[37] Extremal problems for Degree Sequences. Coll. Math. Soc.
J.Bolyai 52. Combinatorics (1987) 183-192 (with S.A.Burr,
P.Erd\H os, R.J.Faudree and R.H.Schelp). MR 94h,05042
[38] On Graphs of Irregularity Strength $2$. Coll. Math. Soc.
J.Bolyai 52. Combinatorics (1987) 239-246 (with R.J.Faudree
and R.H.Schelp). MR 94e, 05140
1989
[39] The Irregularity Strength of $K\sb{n}-mK\sb2$. Utilitas
Mathematica 35 (1989) 111-114. MR 90a, 05180.
[40] A Matrix Labelling Problem. Congressus Numerantium 65
(1988) 237-244 (with R.H.Schelp). MR 90j, 05040.
[41] Covering Complete Graphs by Monochromatic Paths. In
Irregularities of Partitions, Algorithms and Combinatorics 8.
Springer Verlag, (1989) 89-91. MR 90f, 05106.
[42] Induced Matchings in Bipartite Graphs. Discrete Math.
78 (1989) 83-87 (with R.J.Faudree, R.H.Schelp, Zs.Tuza).
MR 90i, 0572.
[43] On a special case of the Wall Problem. Congressus Numerantium 67 (1988) 167-174 (with J.Lehel). MR 90c, 05085.
[44] The size of Chordal, Interval and Treshold Subgraphs.
Combinatorica 9 (1989) 245-253 (with P.Erdős, E.Ordman,
Y.Zalcstein). MR 90i, 05047.
[45] Domination in Colored Complete Graphs. Journal of Graph
Theory 13 (1989) 713-718 (with P.Erdős, R.J.Faudree and
R.H.Schelp). MR 90i, 05049.
András Gyárfás
Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences
