Ervin Györi

	2012
34		Ervin Györi, Nathan Lemons: Hypergraphs with no cycle of length 4. Discrete Mathematics 312(9): 1518-1520 (2012)
	2011
33		Jarik Nesetril, Ervin Györi, Attila Sali: Preface. Electronic Notes in Discrete Mathematics 38: 1-3 (2011)
32		Paul N. Balister, Ervin Györi, Richard H. Schelp: Coloring vertices and edges of a graph by nonempty subsets of a set. Eur. J. Comb. 32(4): 533-537 (2011)
	2010
31		Evelyne Flandrin, Ervin Györi, Hao Li, Jinlong Shu: Cyclability in k-connected K1, 4-free graphs. Discrete Mathematics 310(20): 2735-2741 (2010)
30		Ervin Györi, Gyula Y. Katona, Nathan Lemons: Hypergraph Extensions of the Erdos-Gallai Theorem. Electronic Notes in Discrete Mathematics 36: 655-662 (2010)
29		Tsz Ho Chan, Ervin Györi, András Sárközy: On a problem of Erdos on integers, none of which divides the product of k others. Eur. J. Comb. 31(1): 260-269 (2010)
	2009
28		Ervin Györi, Cory Palmer: A new type of edge-derived vertex coloring. Discrete Mathematics 309(22): 6344-6352 (2009)
27		Ervin Györi, Nathan Lemons: Hypergraphs with no odd cycle of given length. Electronic Notes in Discrete Mathematics 34: 359-362 (2009)
	2008
26		Zoltán Füredi, Ervin Györi, János Pach, Attila Sali: Guest Editors' Foreword. Discrete Mathematics 308(19): 4305 (2008)
25		Béla Bollobás, Ervin Györi: Pentagons vs. triangles. Discrete Mathematics 308(19): 4332-4336 (2008)
24		Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp: Connected graphs without long paths. Discrete Mathematics 308(19): 4487-4494 (2008)
23		Ervin Györi, Mirko Hornák, Cory Palmer, Mariusz Wozniak: General neighbour-distinguishing index of a graph. Discrete Mathematics 308(5-6): 827-831 (2008)
	2007
22		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
21		Ervin Györi: Triangle-Free Hypergraphs. Combinatorics, Probability & Computing 15(1-2): 185-191 (2006)
	2005
20		Ervin Györi, Yoomi Rho: An extremal problem concerning graphs not containing Kt and Kt, t, t. Discrete Mathematics 303(1-3): 56-64 (2005)
	2004
19		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)
	2003
18		Ervin Györi, Vladimir Nikiforov, Richard H. Schelp: Nearly bipartite graphs. Discrete Mathematics 272(2-3): 187-196 (2003)
	2002
17		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)
	2001
16		Ervin Györi, Wilfried Imrich: On the Strong Product of a k-Extendable and an l-Extendable Graph. Graphs and Combinatorics 17(2): 245-253 (2001)
	2000
15		Yoshimi Egawa, Ralph J. Faudree, Ervin Györi, Yoshiyasu Ishigami, Richard H. Schelp, Hong Wang: Vertex-Disjoint Cycles Containing Specified Edges. Graphs and Combinatorics 16(1): 81-92 (2000)
	1997
14		Ervin Györi, Alexandr V. Kostochka, Tomasz Luczak: Graphs without short odd cycles are nearly bipartite. Discrete Mathematics 163(1-3): 279-284 (1997)
13		Ervin Györi: C6-free bipartite graphs and product representation of squares. Discrete Mathematics 165-166: 371-375 (1997)
	1996
12		Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer: Generalized Guarding and Partitioning for Rectilinear Polygons. Comput. Geom. 6: 21-44 (1996)
	1994
11		Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer: Generalized Guarding and Partitioning for Rectilinear Polygons. CCCG 1994: 302-307
	1992
10		Ervin Györi, Michael D. Plummer: The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable. Discrete Mathematics 101(1-3): 87-96 (1992)
	1991
9		Ervin Györi: On the number of edge disjoint cliques in graphs of given size. Combinatorica 11(3): 231-243 (1991)
8		Ervin Györi, János Pach, Miklós Simonovits: On the maximal number of certain subgraphs inKr-free graphs. Graphs and Combinatorics 7(1): 31-37 (1991)
7		Daniel Bienstock, Ervin Györi: An Extremal Problem on Sparse 0-1 Matrices. SIAM J. Discrete Math. 4(1): 17-27 (1991)
	1989
6		Ervin Györi: On the number of C5's in a triangle-free graph. Combinatorica 9(1): 101-102 (1989)
	1986
5		Noga Alon, Ervin Györi: The number of small semispaces of a finite set of points in the plane. J. Comb. Theory, Ser. A 41(1): 154-157 (1986)
	1985
4		Ervin Györi: Covering simply connected regions by rectangles. Combinatorica 5(1): 53-55 (1985)
	1984
3		Ervin Györi: A minimax theorem on intervals. J. Comb. Theory, Ser. B 37(1): 1-9 (1984)
	1981
2		Ervin Györi: Partition conditions and vertex-connectivity of graphs. Combinatorica 1(3): 263-273 (1981)
1		Ervin Györi: An n-dimensional search problem with restricted questions. Combinatorica 1(4): 377-380 (1981)

Coauthor Index

1	Noga Alon	[5]
2	Paul N. Balister (Paul Balister)	[19] [22] [24] [32]
3	Daniel Bienstock	[7]
4	Béla Bollobás	[25]
5	Tsz Ho Chan	[29]
6	Yoshimi Egawa	[15]
7	Ralph J. Faudree	[15]
8	Evelyne Flandrin	[31]
9	Zoltán Füredi	[26]
10	Frank Hoffmann	[11] [12]
11	Mirko Hornák	[23]
12	Wilfried Imrich	[16]
13	Yoshiyasu Ishigami	[15]
14	Gyula Y. Katona	[30]
15	Alexandr V. Kostochka	[14]
16	Klaus Kriegel	[11] [12]
17	Jenö Lehel (Jeno Lehel)	[19] [22] [24]
18	Nathan Lemons	[27] [30] [34]
19	Hao Li	[31]
20	Tomasz Luczak	[14]
21	Jaroslav Nesetril (Jarik Nesetril)	[33]
22	Vladimir Nikiforov	[18]
23	János Pach	[8] [26]
24	Cory Palmer	[23] [28]
25	Michael D. Plummer	[10]
26	Yoomi Rho	[20]
27	Attila Sali	[26] [33]
28	András Sárközy	[29]
29	Richard H. Schelp	[15] [17] [18] [19] [22] [24] [32]
30	Thomas C. Shermer	[11] [12]
31	Jinlong Shu	[31]
32	Miklós Simonovits	[8]
33	Hong Wang	[15]
34	Mariusz Wozniak	[23]

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