The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

András Gyárfás: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Paul Erdös, András Gyárfás
    A Variant of the Classical Ramsey Problem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:4, pp:459-467 [Journal]
  2. Paul Erdös, András Gyárfás, Edward T. Ordman, Yechezkel Zalcstein
    The size of chordal, interval and threshold subgraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:3, pp:245-253 [Journal]
  3. Paul Erdös, András Gyárfás, Miklós Ruszinkó
    How to decrease the diameter of triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:4, pp:493-501 [Journal]
  4. András Gyárfás
    Transitive Edge Coloring of Graphs and Dimension of Lattices. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:4, pp:479-496 [Journal]
  5. András Gyárfás, Alice Hubenko, József Solymosi
    Large Cliques in C4-Free Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:2, pp:269-274 [Journal]
  6. András Gyárfás, Jenö Lehel
    Hypergraph families with bounded edge cover or transversal number. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1983, v:3, n:3, pp:351-358 [Journal]
  7. András Gyárfás, Jenö Lehel
    Effective on-line coloring of P5-free graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:2, pp:181-184 [Journal]
  8. András Gyárfás, Jenö Lehel, Zsolt Tuza
    How many atoms can be defined by boxes. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:3, pp:193-204 [Journal]
  9. 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. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:1, pp:41-52 [Journal]
  10. Daniel J. Kleitman, András Gyárfás, Géza Tóth
    Convex Sets in the Plane with Three of Every Four Meeting. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:2, pp:221-232 [Journal]
  11. András Gyárfás
    Fruit Salad. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:1, pp:- [Journal]
  12. Paul Erdös, András Gyárfás, Tomasz Luczak
    Independet Transversals in Sparse Partite Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:293-296 [Journal]
  13. Zoltán Füredi, András Gyárfás, Gábor Simonyi
    Connected matchings and Hadwiger's conjecture. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2005, v:14, n:3, pp:435-438 [Journal]
  14. András Gyárfás, Richard H. Schelp
    A Communication Problem and Directed Triple Systems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:85, n:2, pp:139-147 [Journal]
  15. Zoltán Füredi, András Gyárfás, Miklós Ruszinkó
    On the maximum size of (p, Q)-free families. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:385-403 [Journal]
  16. András Gyárfás, André E. Kézdy, Jenö Lehel
    A finite basis characterization of ?-split colorings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:415-421 [Journal]
  17. Mathew Cropper, András Gyárfás, Jenö Lehel
    Hall ratio of the Mycielski graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:16, pp:1988-1990 [Journal]
  18. András Gyárfás, Michael S. Jacobson, André E. Kézdy, Jenö Lehel
    Odd cycles and Theta-cycles in hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:19-20, pp:2481-2491 [Journal]
  19. Paul N. Balister, András Gyárfás, Jenö Lehel, Richard H. Schelp
    Mono-multi bipartite Ramsey numbers, designs, and matrices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:1, pp:101-112 [Journal]
  20. Aart Blokhuis, Ralph J. Faudree, András Gyárfás, Miklós Ruszinkó
    Anti-Ramsey Colorings in Several Rounds. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:82, n:1, pp:1-18 [Journal]
  21. Paul Erdös, András Gyárfás, László Pyber
    Vertex coverings by monochromatic cycles and trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:51, n:1, pp:90-95 [Journal]
  22. Barry Guiduli, András Gyárfás, Stéphan Thomassé, Peter Weidl
    2-Partition-Transitive Tournaments. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:72, n:2, pp:181-196 [Journal]
  23. András Gyárfás
    Generalized Split Graphs and Ramsey Numbers. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1998, v:81, n:2, pp:255-261 [Journal]
  24. András Gyárfás, Jenö Lehel
    Linear Sets with Five Distinct Differences among Any Four Elements. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:64, n:1, pp:108-118 [Journal]
  25. András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza
    Local k-colorings of graphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:43, n:2, pp:127-139 [Journal]
  26. 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. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:6, pp:855-873 [Journal]
  27. Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö
    Coloring the Maximal Cliques of Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:17, n:3, pp:361-376 [Journal]
  28. András Gyárfás, Zoltán Király, Jenö Lehel
    On-Line 3-Chromatic Graphs I. Triangle-Free Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:3, pp:385-411 [Journal]
  29. András Gyárfás, Alice Hubenko
    Semistrong edge coloring of graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:49, n:1, pp:39-47 [Journal]
  30. András Gyárfás, Jenö Lehel, Richard H. Schelp
    Finding a monochromatic subgraph or a rainbow path. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2007, v:54, n:1, pp:1-12 [Journal]
  31. András Gyárfás, Gábor Simonyi
    Edge colorings of complete graphs without tricolored triangles. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:46, n:3, pp:211-216 [Journal]
  32. András Gyárfás, T. Jensen, Michael Stiebitz
    On graphs with strongly independent color-classes. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:46, n:1, pp:1-14 [Journal]
  33. András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
    Three-Color Ramsey Numbers For Paths. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2007, v:27, n:1, pp:35-69 [Journal]
  34. András Gyárfás, Jenö Lehel, Zsolt Tuza
    The structure of rectangle families dividing the plane into maximum number of atoms. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:52, n:2-3, pp:177-198 [Journal]
  35. András Gyárfás
    On the chromatic number of multiple interval graphs and overlap graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:161-166 [Journal]
  36. András Gyárfás, Jenö Lehel
    Covering and coloring problems for relatives of intervals. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:167-180 [Journal]
  37. András Gyárfás
    Corrigendum. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:3, pp:333- [Journal]
  38. András Gyárfás, Zsolt Tuza
    An upper bound on the Ramsey number of trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:309-310 [Journal]
  39. András Gyárfás, Michael S. Jacobson, Lael F. Kinch
    On a generalization of transitivity for digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:1, pp:35-41 [Journal]
  40. András Gyárfás, Jenö Lehel, Zsolt Tuza
    Clumsy packing of dominoes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:71, n:1, pp:33-46 [Journal]
  41. András Gyárfás
    The irregularity strength of Km, m is 4 for odd m. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:71, n:3, pp:273-274 [Journal]
  42. Ralph J. Faudree, András Gyárfás, Richard H. Schelp, Zsolt Tuza
    Induced matchings in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:78, n:1-2, pp:83-87 [Journal]
  43. Guantao Chen, András Gyárfás, Richard H. Schelp
    Vertex colorings with a distance restriction. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:65-82 [Journal]
  44. Paul Erdös, András Gyárfás
    Split and balanced colorings of complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:79-86 [Journal]
  45. Paul Erdös, András Gyárfás, Yoshiharu Kohayakawa
    The size of the largest bipartite subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:177, n:1-3, pp:267-271 [Journal]
  46. András Gyárfás, Zoltán Király, Jenö Lehel
    On-line 3-chromatic graphs - II critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:177, n:1-3, pp:99-122 [Journal]
  47. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:81, n:2, pp:129-135 [Journal]
  48. András Gyárfás
    A simple lower bound on edge coverings by cliques. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:1, pp:103-104 [Journal]
  49. András Gyárfás
    Graphs with k odd cycle lengths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:103, n:1, pp:41-48 [Journal]
  50. Paul Erdös, András Gyárfás, Tomasz Luczak
    Graphs in which each C4 spans K4. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:154, n:1-3, pp:263-268 [Journal]
  51. Ralph J. Faudree, Richard H. Schelp, Linda M. Lesniak, András Gyárfás, Jenö Lehel
    On the rotation distance of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:126, n:1-3, pp:121-135 [Journal]

  52. Three-color Ramsey numbers for paths. [Citation Graph (, )][DBLP]


  53. Highly connected monochromatic subgraphs. [Citation Graph (, )][DBLP]


  54. Size of monochromatic components in local edge colorings. [Citation Graph (, )][DBLP]


  55. Disjoint chorded cycles in graphs. [Citation Graph (, )][DBLP]


  56. Large monochromatic components in colorings of complete 3-uniform hypergraphs. [Citation Graph (, )][DBLP]


  57. Stability of the path-path Ramsey number. [Citation Graph (, )][DBLP]


  58. Gallai colorings of non-complete graphs. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002