Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
Share This Author
Vertex coverings by monochromatic cycles and trees
- P. Erdös, A. Gyárfás, L. Pyber
- MathematicsJ. Comb. Theory, Ser. B
- 2 January 1991
A variant of the classical Ramsey problem
- P. Erdös, A. Gyárfás
- MathematicsComb.
- 1 December 1997
TLDR
Edge colorings of complete graphs without tricolored triangles
- A. Gyárfás, G. Simonyi
- MathematicsJ. Graph Theory
- 1 July 2004
We show some consequences of results of Gallai concerning edge colorings of complete graphs that contain no tricolored triangles. We prove two conjectures of Bialostocki and Voxman about the…
An improved bound for the monochromatic cycle partition number
- A. Gyárfás, M. Ruszinkó, Gábor N. Sárközy, E. Szemerédi
- MathematicsJ. Comb. Theory, Ser. B
- 1 November 2006
On-line and first fit colorings of graphs
- A. Gyárfás, J. Lehel
- MathematicsJ. Graph Theory
- 1 June 1988
TLDR
Coloring the Maximal Cliques of Graphs
- Gábor Bacsó, Sylvain Gravier, A. Gyárfás, M. Preissmann, András Sebö
- MathematicsSIAM J. Discret. Math.
- 1 March 2004
TLDR
Three-Color Ramsey Numbers For Paths
- A. Gyárfás, M. Ruszinkó, Gábor N. Sárközy, E. Szemerédi
- MathematicsComb.
- 2007
TLDR
THE STRONG CHROMATIC INDEX OF GRAPHS
- J. Faudree, R. Schelp, A. Gyárfás
- Mathematics
- 1990
Problems and results are presented concerning the strong chromatic index, where the strong chromatic index is the smallest k such that the edges of the graph can be k-colored with the property that…
Vertex coverings by monochromatic paths and cycles
- A. Gyárfás
- MathematicsJ. Graph Theory
- 1 March 1983
TLDR
...
1
2
3
4
5
...