András Gyárfás

	2011
76		András Gyárfás, Gábor N. Sárközy: The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle. Combinatorics, Probability & Computing 20(1): 53-71 (2011)
75		András Gyárfás, Jenö Lehel: Trees in greedy colorings of hypergraphs. Discrete Mathematics 311(2-3): 208-209 (2011)
74		András Gyárfás, Manouchehr Zaker: On (δ, χ)-Bounded Families of Graphs. Electr. J. Comb. 18(1): (2011)
73		András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi: Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles. Electr. J. Comb. 18(1): (2011)
	2010
72		András Gyárfás, Gábor N. Sárközy: Gallai colorings of non-complete graphs. Discrete Mathematics 310(5): 977-980 (2010)
71		András Gyárfás, Gábor N. Sárközy, Endre Szemerédi: Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs. Graphs and Combinatorics 26(1): 71-76 (2010)
70		András Gyárfás, Gábor N. Sárközy, Endre Szemerédi: Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs. Journal of Graph Theory 63(4): 288-299 (2010)
69		András Gyárfás, Gábor N. Sárközy, András Sebö, Stanley M. Selkow: Ramsey-type results for Gallai colorings. Journal of Graph Theory 64(3): 233-243 (2010)
	2009
68		András Gyárfás, Penny E. Haxell: Large monochromatic components in colorings of complete 3-uniform hypergraphs. Discrete Mathematics 309(10): 3156-3160 (2009)
67		András Gyárfás, Gábor N. Sárközy, Endre Szemerédi: Stability of the path-path Ramsey number. Discrete Mathematics 309(13): 4590-4595 (2009)
66		András Gyárfás, Gábor N. Sárközy, Richard H. Schelp: Multipartite Ramsey numbers for odd cycles. Journal of Graph Theory 61(1): 12-21 (2009)
	2008
65		András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi: Three-color Ramsey numbers for paths. Combinatorica 28(4): 499-502 (2008)
64		András Gyárfás, Gábor N. Sárközy: Size of monochromatic components in local edge colorings. Discrete Mathematics 308(12): 2620-2622 (2008)
63		Arie Bialostocki, Daniel Finkel, András Gyárfás: Disjoint chorded cycles in graphs. Discrete Mathematics 308(23): 5886-5890 (2008)
62		Béla Bollobás, András Gyárfás: Highly connected monochromatic subgraphs. Discrete Mathematics 308(9): 1722-1725 (2008)
61		András Gyárfás, Gábor N. Sárközy, Endre Szemerédi: The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs. Electr. J. Comb. 15(1): (2008)
60		András Gyárfás: Ramsey and Turán-type problems in bipartite geometric graphs. Electronic Notes in Discrete Mathematics 31: 253-254 (2008)
59		András Gyárfás, Gábor N. Sárközy: Size of Monochromatic Double Stars in Edge Colorings. Graphs and Combinatorics 24(6): 531-536 (2008)
58		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)
57		Zoltán Füredi, András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow: Inequalities for the first-fit chromatic number. Journal of Graph Theory 59(1): 75-88 (2008)
	2007
56		András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi: Three-Color Ramsey Numbers For Paths. Combinatorica 27(1): 35-69 (2007)
55		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)
54		Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott: Maximum directed cuts in acyclic digraphs. Journal of Graph Theory 55(1): 1-13 (2007)
53		András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi: Tripartite Ramsey numbers for paths. Journal of Graph Theory 55(2): 164-174 (2007)
	2006
52		Mathew Cropper, András Gyárfás, Jenö Lehel: Hall ratio of the Mycielski graphs. Discrete Mathematics 306(16): 1988-1990 (2006)
51		András Gyárfás, Michael S. Jacobson, André E. Kézdy, Jenö Lehel: Odd cycles and Theta-cycles in hypergraphs. Discrete Mathematics 306(19-20): 2481-2491 (2006)
50		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)
49		András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi: An improved bound for the monochromatic cycle partition number. J. Comb. Theory, Ser. B 96(6): 855-873 (2006)
	2005
48		Zoltán Füredi, András Gyárfás, Gábor Simonyi: Connected matchings and Hadwiger's conjecture. Combinatorics, Probability & Computing 14(3): 435-438 (2005)
47		András Gyárfás, Alice Hubenko: Semistrong edge coloring of graphs. Journal of Graph Theory 49(1): 39-47 (2005)
	2004
46		András Gyárfás, T. Jensen, Michael Stiebitz: On graphs with strongly independent color-classes. Journal of Graph Theory 46(1): 1-14 (2004)
45		András Gyárfás, Gábor Simonyi: Edge colorings of complete graphs without tricolored triangles. Journal of Graph Theory 46(3): 211-216 (2004)
44		Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö: Coloring the Maximal Cliques of Graphs. SIAM J. Discrete Math. 17(3): 361-376 (2004)
	2002
43		András Gyárfás, Alice Hubenko, József Solymosi: Large Cliques in C4-Free Graphs. Combinatorica 22(2): 269-274 (2002)
42		András Gyárfás: Transitive Edge Coloring of Graphs and Dimension of Lattices. Combinatorica 22(4): 479-496 (2002)
41		Zoltán Füredi, András Gyárfás, Miklós Ruszinkó: On the maximum size of (p, Q)-free families. Discrete Mathematics 257(2-3): 385-403 (2002)
40		András Gyárfás, André E. Kézdy, Jenö Lehel: A finite basis characterization of ?-split colorings. Discrete Mathematics 257(2-3): 415-421 (2002)
	2001
39		Daniel J. Kleitman, András Gyárfás, Géza Tóth: Convex Sets in the Plane with Three of Every Four Meeting. Combinatorica 21(2): 221-232 (2001)
38		Zoltán Füredi, András Gyárfás, Miklós Ruszinkó: On the Maximum Size of (p, Q) - free Families. Electronic Notes in Discrete Mathematics 10: 247-249 (2001)
37		Aart Blokhuis, Ralph J. Faudree, András Gyárfás, Miklós Ruszinkó: Anti-Ramsey Colorings in Several Rounds. J. Comb. Theory, Ser. B 82(1): 1-18 (2001)
	1999
36		Paul Erdös, András Gyárfás: Split and balanced colorings of complete graphs. Discrete Mathematics 200(1-3): 79-86 (1999)
35		András Gyárfás, Zoltán Király, Jenö Lehel: On-Line 3-Chromatic Graphs I. Triangle-Free Graphs. SIAM J. Discrete Math. 12(3): 385-411 (1999)
	1998
34		Paul Erdös, András Gyárfás, Miklós Ruszinkó: How to decrease the diameter of triangle-free graphs. Combinatorica 18(4): 493-501 (1998)
33		András Gyárfás, Richard H. Schelp: A Communication Problem and Directed Triple Systems. Discrete Applied Mathematics 85(2): 139-147 (1998)
32		Guantao Chen, András Gyárfás, Richard H. Schelp: Vertex colorings with a distance restriction. Discrete Mathematics 191(1-3): 65-82 (1998)
31		András Gyárfás: Generalized Split Graphs and Ramsey Numbers. J. Comb. Theory, Ser. A 81(2): 255-261 (1998)
30		Barry Guiduli, András Gyárfás, Stéphan Thomassé, Peter Weidl: 2-Partition-Transitive Tournaments. J. Comb. Theory, Ser. B 72(2): 181-196 (1998)
	1997
29		Paul Erdös, András Gyárfás: A Variant of the Classical Ramsey Problem. Combinatorica 17(4): 459-467 (1997)
28		Paul Erdös, András Gyárfás, Yoshiharu Kohayakawa: The size of the largest bipartite subgraphs. Discrete Mathematics 177(1-3): 267-271 (1997)
27		András Gyárfás, Zoltán Király, Jenö Lehel: On-line 3-chromatic graphs - II critical graphs. Discrete Mathematics 177(1-3): 99-122 (1997)
26		András Gyárfás: Fruit Salad. Electr. J. Comb. 4(1): (1997)
	1996
25		Paul Erdös, András Gyárfás, Tomasz Luczak: Graphs in which each C4 spans K4. Discrete Mathematics 154(1-3): 263-268 (1996)
	1995
24		András Gyárfás, Jenö Lehel: Linear Sets with Five Distinct Differences among Any Four Elements. J. Comb. Theory, Ser. B 64(1): 108-118 (1995)
	1994
23		Paul Erdös, András Gyárfás, Tomasz Luczak: Independet Transversals in Sparse Partite Hypergraphs. Combinatorics, Probability & Computing 3: 293-296 (1994)
22		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)
	1992
21		András Gyárfás: Graphs with k odd cycle lengths. Discrete Mathematics 103(1): 41-48 (1992)
20		Ralph J. Faudree, András Gyárfás, Jenö Lehel: Three-regular path pairable graphs. Graphs and Combinatorics 8(1): 45-52 (1992)
	1991
19		András Gyárfás, Jenö Lehel: Effective on-line coloring of P5-free graphs. Combinatorica 11(2): 181-184 (1991)
18		Paul Erdös, András Gyárfás, László Pyber: Vertex coverings by monochromatic cycles and trees. J. Comb. Theory, Ser. B 51(1): 90-95 (1991)
	1990
17		Fan R. K. Chung, András Gyárfás, Zsolt Tuza, William T. Trotter: The maximum number of edges in 2K2-free graphs of bounded degree. Discrete Mathematics 81(2): 129-135 (1990)
16		András Gyárfás: A simple lower bound on edge coverings by cliques. Discrete Mathematics 85(1): 103-104 (1990)
	1989
15		Paul Erdös, András Gyárfás, Edward T. Ordman, Yechezkel Zalcstein: The size of chordal, interval and threshold subgraphs. Combinatorica 9(3): 245-253 (1989)
14		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)
	1988
13		András Gyárfás, Michael S. Jacobson, Lael F. Kinch: On a generalization of transitivity for digraphs. Discrete Mathematics 69(1): 35-41 (1988)
12		András Gyárfás, Jenö Lehel, Zsolt Tuza: Clumsy packing of dominoes. Discrete Mathematics 71(1): 33-46 (1988)
11		András Gyárfás: The irregularity strength of Km, m is 4 for odd m. Discrete Mathematics 71(3): 273-274 (1988)
	1987
10		András Gyárfás, Zsolt Tuza: An upper bound on the Ramsey number of trees. Discrete Mathematics 66(3): 309-310 (1987)
9		András Gyárfás, Jeno Lehel, Richard H. Schelp, Zsolt Tuza: Ramsey numbers for local colorings. Graphs and Combinatorics 3(1): 267-277 (1987)
8		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
7		András Gyárfás: Corrigendum. Discrete Mathematics 62(3): 333 (1986)
	1985
6		András Gyárfás, Hans Jürgen Prömel, Endre Szemerédi, Bernd Voigt: On the sum of the reciprocals of cycle lengths in sparse graphs. Combinatorica 5(1): 41-52 (1985)
5		András Gyárfás, Jenö Lehel, Zsolt Tuza: How many atoms can be defined by boxes. Combinatorica 5(3): 193-204 (1985)
4		András Gyárfás: On the chromatic number of multiple interval graphs and overlap graphs. Discrete Mathematics 55(2): 161-166 (1985)
3		András Gyárfás, Jenö Lehel: Covering and coloring problems for relatives of intervals. Discrete Mathematics 55(2): 167-180 (1985)
	1984
2		András Gyárfás, Jenö Lehel, Zsolt Tuza: The structure of rectangle families dividing the plane into maximum number of atoms. Discrete Mathematics 52(2-3): 177-198 (1984)
	1983
1		András Gyárfás, Jenö Lehel: Hypergraph families with bounded edge cover or transversal number. Combinatorica 3(3): 351-358 (1983)

Coauthor Index

1	Noga Alon	[54]
2	Gábor Bacsó	[44]
3	Paul N. Balister (Paul Balister)	[50]
4	Arie Bialostocki	[63]
5	Aart Blokhuis	[37]
6	Béla Bollobás	[54] [62]
7	Guantao Chen	[32]
8	Fan R. K. Chung (Fan Chung Graham)	[17]
9	Mathew Cropper	[52]
10	Paul Erdös	[15] [18] [23] [25] [28] [29] [34] [36]
11	Ralph J. Faudree	[14] [20] [22] [37]
12	Daniel Finkel	[63]
13	Zoltán Füredi	[38] [41] [48] [57]
14	Sylvain Gravier	[44]
15	Barry Guiduli	[30]
16	Penny E. Haxell	[68]
17	Alice Hubenko	[43] [47]
18	Michael S. Jacobson	[13] [51]
19	T. Jensen	[46]
20	André E. Kézdy	[40] [51]
21	Lael F. Kinch	[13]
22	Zoltán Király	[27] [35]
23	Daniel J. Kleitman	[39]
24	Yoshiharu Kohayakawa	[28]
25	Jenö Lehel (Jeno Lehel)	[1] [2] [3] [5] [8] [9] [12] [19] [20] [22] [24] [27] [35] [40] [50] [51] [52] [54] [55] [58] [75]
26	Linda M. Lesniak	[22]
27	Tomasz Luczak	[23] [25]
28	Jaroslav Nesetril (Jarik Nesetril)	[8]
29	Edward T. Ordman	[15]
30	Myriam Preissmann	[44]
31	Hans Jürgen Prömel	[6]
32	László Pyber	[18]
33	Vojtech Rödl	[8]
34	Miklós Ruszinkó	[34] [37] [38] [41] [49] [53] [56] [65] [73]
35	Gábor N. Sárközy	[49] [53] [56] [57] [58] [59] [61] [64] [65] [66] [67] [69] [70] [71] [72] [73] [76]
36	Richard H. Schelp	[8] [9] [14] [22] [32] [33] [50] [55] [58] [66]
37	Alex D. Scott (Alexander D. Scott)	[54]
38	András Sebö	[44] [69]
39	Stanley M. Selkow	[57] [69]
40	Gábor Simonyi	[45] [48]
41	József Solymosi	[43]
42	Michael Stiebitz	[46]
43	Endre Szemerédi	[6] [49] [53] [56] [61] [65] [67] [70] [71] [73]
44	Stéphan Thomassé	[30]
45	Géza Tóth	[39]
46	William T. Trotter	[17]
47	Zsolt Tuza	[2] [5] [8] [9] [10] [12] [14] [17]
48	Bernd Voigt	[6]
49	Peter Weidl	[30]
50	Manouchehr Zaker	[74]
51	Yechezkel Zalcstein	[15]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page