András Gyárfás - Concepedia

Author

András Gyárfás

Also Known As

A Gyárfás, A. Gyarfas, A. Gyárfas, A. Gyárfás, ANDRÁS GYÁRFÁS, Alfréd Gyárfás, Andras Gyarfas, Andras Gyárfás, András Gyárfás, Andrs Gyrfs

183

Publications

3.5K

Citations

H-Index

Concepts

All Affiliations

Hungarian Academy of Sciences Institute for Computer Science and Control Worcester Polytechnic Institute University of Memphis Alfréd Rényi Institute of Mathematics

About

András Gyárfás is an author at Hungarian Academy of Sciences specializing in graph theory, discrete mathematics, and combinatorial optimization.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Education	16	21	865
2	Engineering	14	18	1.2K
3	Business	4	4	56
4	Communication	1	1	22
5	Computer Engineering	1	1	22

András Gyárfás

Publications

Citations

H-Index

Page 1

	Year	Citations
Problems from the world surrounding perfect graphs András Gyárfás Applicationes Mathematicae Graph MinorGeometric Graph TheoryEngineeringNetwork ScienceGraph Theory	1987	366
On‐line and first fit colorings of graphs András Gyárfás, Jenő Lehel Journal of Graph Theory EngineeringPlanar GraphNetwork AnalysisEducationComputational Complexity	1988	193
Vertex coverings by monochromatic cycles and trees Péter L. Erdős, András Gyárfás, L. Pyber Journal of Combinatorial Theory Series B Graph TheoryAlgebraic Graph TheoryTopological Graph TheoryExtremal Graph TheoryDiscrete Mathematics	1991	136
Edge colorings of complete graphs without tricolored triangles András Gyárfás, Gábor Simony Journal of Graph Theory Geometric Graph TheoryGraph TheoryAlgebraic Graph TheoryPlanar GraphTricolored Triangles	2004	124
The maximum number of edges in 2K2-free graphs of bounded degree Fan Chung, András Gyárfás, Zs. Tuza, Discrete Mathematics Geometric Graph TheoryGraph TheoryAlgebraic Graph TheoryTopological Graph TheoryPlanar Graph	1990	98
Induced matchings in bipartite graphs Ralph J. Faudree, András Gyárfás, R. H. Schelp, Discrete Mathematics Network ScienceGraph TheoryEngineeringExtremal Graph TheorySocial Matching	1989	95
A variant of the classical Ramsey problem Paul Erdős, András Gyárfás COMBINATORICA Graph TheoryExtremal Graph TheoryClassical Ramsey ProblemExtremal Set TheoryExtremal Combinatorics	1997	86
An improved bound for the monochromatic cycle partition number András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Journal of Combinatorial Theory Series B Graph TheoryCombinatorial Design TheoryEnumerative CombinatoricsImproved BoundDiscrete Mathematics	2006	84
Covering and coloring problems for relatives of intervals András Gyárfás, Jenő Lehel Discrete Mathematics Mathematical ProgrammingEngineeringExtremal CombinatoricsDiscrete MathematicsCombinatorial Optimization	1985	83
Coloring the Maximal Cliques of Graphs Gábor Bacsó, Sylvain Gravier, András Gyárfás, SIAM Journal on Discrete Mathematics Perfect GraphNetwork ScienceGraph TheoryClique-chromatic NumberEngineering	2004	77

Page 1