Search the dblp DataBase

Publications of Author

1. Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer
   Generalized Guarding and Partitioning for Rectilinear Polygons. [Citation Graph (0, 0)][DBLP]
   CCCG, 1994, pp:302-307 [Conf]
   
2. Ervin Györi
   Partition conditions and vertex-connectivity of graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1981, v:1, n:3, pp:263-273 [Journal]
   
3. Ervin Györi
   An n-dimensional search problem with restricted questions. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1981, v:1, n:4, pp:377-380 [Journal]
   
4. Ervin Györi
   Covering simply connected regions by rectangles. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1985, v:5, n:1, pp:53-55 [Journal]
   
5. Ervin Györi
   On the number of C₅'s in a triangle-free graph. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1989, v:9, n:1, pp:101-102 [Journal]
   
6. Ervin Györi
   On the number of edge disjoint cliques in graphs of given size. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1991, v:11, n:3, pp:231-243 [Journal]
   
7. Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer
   Generalized Guarding and Partitioning for Rectilinear Polygons. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 1996, v:6, n:, pp:21-44 [Journal]
   
8. Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
   Longest Paths in Circular Arc Graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2004, v:13, n:3, pp:311-317 [Journal]
   
9. Ervin Györi, Vladimir Nikiforov, Richard H. Schelp
   Nearly bipartite graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:272, n:2-3, pp:187-196 [Journal]
   
10. Ervin Györi, Yoomi Rho
    An extremal problem concerning graphs not containing K_t and K_{t, t, t}. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:303, n:1-3, pp:56-64 [Journal]
    
11. Ervin Györi, Richard H. Schelp
    Two-edge colorings of graphs with bounded degree in both colors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:249, n:1-3, pp:105-110 [Journal]
    
12. Ervin Györi, Wilfried Imrich
    On the Strong Product of a k-Extendable and an l-Extendable Graph. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:2, pp:245-253 [Journal]
    
13. Noga Alon, Ervin Györi
    The number of small semispaces of a finite set of points in the plane. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:41, n:1, pp:154-157 [Journal]
    
14. Ervin Györi
    A minimax theorem on intervals. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:1, pp:1-9 [Journal]
    
15. Daniel Bienstock, Ervin Györi
    An Extremal Problem on Sparse 0-1 Matrices. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:1, pp:17-27 [Journal]
    
16. Ervin Györi, Alexandr V. Kostochka, Tomasz Luczak
    Graphs without short odd cycles are nearly bipartite. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:163, n:1-3, pp:279-284 [Journal]
    
17. Ervin Györi
    C₆-free bipartite graphs and product representation of squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:371-375 [Journal]
    
18. Ervin Györi, Michael D. Plummer
    The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:87-96 [Journal]
    
19. 
    Triangle-Free Hypergraphs. [Citation Graph (, )][DBLP]
    
    
20. 
    General neighbour-distinguishing index of a graph. [Citation Graph (, )][DBLP]
    
    
21. 
    Pentagons vs. triangles. [Citation Graph (, )][DBLP]
    
    
22. 
    Connected graphs without long paths. [Citation Graph (, )][DBLP]
    
    
23. 
    Guest Editors' Foreword. [Citation Graph (, )][DBLP]
    
    
24. 
    A new type of edge-derived vertex coloring. [Citation Graph (, )][DBLP]
    
    
25. 
    Cyclability in k-connected K_{1, 4}-free graphs. [Citation Graph (, )][DBLP]
    
    
26. 
    On a problem of Erdos on integers, none of which divides the product of k others. [Citation Graph (, )][DBLP]