- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j37 |      | Ervin Györi, Nathan Lemons: 3-uniform hypergraphs avoiding a given odd cycle. Combinatorica 32(2): 187-203 (2012) |
| j36 | | Ervin Györi, Hao Li: The Maximum Number of Triangles in C2k+1-Free Graphs. Combinatorics, Probability & Computing 21(1-2): 187-191 (2012) |
| j35 | | Ervin Györi, Nathan Lemons: Hypergraphs with No Cycle of a Given Length. Combinatorics, Probability & Computing 21(1-2): 193-201 (2012) |
| j34 | | Ervin Györi, Nathan Lemons: Hypergraphs with no cycle of length 4. Discrete Mathematics 312(9): 1518-1520 (2012) |
| 2011 | ||
| j33 | | 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) |
| j32 | | Jarik Nesetril, Ervin Györi, Attila Sali: Preface. Electronic Notes in Discrete Mathematics 38: 1-3 (2011) |
| 2010 | ||
| j31 | | Evelyne Flandrin, Ervin Györi, Hao Li, Jinlong Shu: Cyclability in k-connected K1, 4-free graphs. Discrete Mathematics 310(20): 2735-2741 (2010) |
| j30 | | 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) |
| j29 | | Ervin Györi, Gyula Y. Katona, Nathan Lemons: Hypergraph Extensions of the Erdos-Gallai Theorem. Electronic Notes in Discrete Mathematics 36: 655-662 (2010) |
| 2009 | ||
| j28 | | Ervin Györi, Cory Palmer: A new type of edge-derived vertex coloring. Discrete Mathematics 309(22): 6344-6352 (2009) |
| j27 | | Ervin Györi, Nathan Lemons: Hypergraphs with no odd cycle of given length. Electronic Notes in Discrete Mathematics 34: 359-362 (2009) |
| 2008 | ||
| j26 | | 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) |
| j25 | | Zoltán Füredi, Ervin Györi, János Pach, Attila Sali: Guest Editors' Foreword. Discrete Mathematics 308(19): 4305 (2008) |
| j24 | | |
| j23 | | Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp: Connected graphs without long paths. Discrete Mathematics 308(19): 4487-4494 (2008) |
| 2007 | ||
| j22 | | 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 | ||
| j21 | | Ervin Györi: Triangle-Free Hypergraphs. Combinatorics, Probability & Computing 15(1-2): 185-191 (2006) |
| 2005 | ||
| j20 | | 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 | ||
| j19 | | 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 | ||
| j18 | | Ervin Györi, Vladimir Nikiforov, Richard H. Schelp: Nearly bipartite graphs. Discrete Mathematics 272(2-3): 187-196 (2003) |
| 2002 | ||
| j17 | | 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 | ||
| j16 | | 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 | ||
| j15 | | 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 | ||
| j14 | | Ervin Györi, Alexandr V. Kostochka, Tomasz Luczak: Graphs without short odd cycles are nearly bipartite. Discrete Mathematics 163(1-3): 279-284 (1997) |
| j13 | | Ervin Györi: C6-free bipartite graphs and product representation of squares. Discrete Mathematics 165-166: 371-375 (1997) |
| 1996 | ||
| j12 | | Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer: Generalized Guarding and Partitioning for Rectilinear Polygons. Comput. Geom. 6: 21-44 (1996) |
| 1994 | ||
| c1 |  | Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer: Generalized Guarding and Partitioning for Rectilinear Polygons. CCCG 1994: 302-307 |
| 1992 | ||
| j11 | | 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 | ||
| j10 | | Ervin Györi: On the number of edge disjoint cliques in graphs of given size. Combinatorica 11(3): 231-243 (1991) |
| j9 | | 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) |
| j8 | | Daniel Bienstock, Ervin Györi: An Extremal Problem on Sparse 0-1 Matrices. SIAM J. Discrete Math. 4(1): 17-27 (1991) |
| 1989 | ||
| j7 | | |
| 1988 | ||
| j6 | | Daniel Bienstock, Ervin Györi: Average distance in graphs with removed elements. Journal of Graph Theory 12(3): 375-390 (1988) |
| 1986 | ||
| j5 | | 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 | ||
| j4 | | |
| 1984 | ||
| j3 | | |
| 1981 | ||
| j2 | | Ervin Györi: Partition conditions and vertex-connectivity of graphs. Combinatorica 1(3): 263-273 (1981) |
| j1 | | Ervin Györi: An n-dimensional search problem with restricted questions. Combinatorica 1(4): 377-380 (1981) |
Colors in the list of coauthors
Last update Fri May 24 02:21:06 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page