Zs. Tuza

1.8k total citations
65 papers, 1.1k citations indexed

About

Zs. Tuza is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Zs. Tuza has authored 65 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 50 papers in Computational Theory and Mathematics, 31 papers in Discrete Mathematics and Combinatorics and 15 papers in Geometry and Topology. Recurrent topics in Zs. Tuza's work include Advanced Graph Theory Research (46 papers), Limits and Structures in Graph Theory (31 papers) and Graph Labeling and Dimension Problems (18 papers). Zs. Tuza is often cited by papers focused on Advanced Graph Theory Research (46 papers), Limits and Structures in Graph Theory (31 papers) and Graph Labeling and Dimension Problems (18 papers). Zs. Tuza collaborates with scholars based in Hungary, Germany and United States. Zs. Tuza's co-authors include Mihály Hujter, András Gyárfás, Jenő Lehel, Margit Voigt, Gábor Bacsó, R. H. Schelp, Miklós Bíró, Endre Szemerédi, Yannis Manoussakis and Ralph J. Faudree and has published in prestigious journals such as Computers & Chemical Engineering, Computers & Mathematics with Applications and Annals of Operations Research.

In The Last Decade

Zs. Tuza

63 papers receiving 980 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Zs. Tuza Hungary	19	868	575	264	169	149	65	1.1k
Bjarne Toft Denmark	12	610 0.7×	319 0.6×	129 0.5×	187 1.1×	117 0.8×	33	762
Vadim Lozin United Kingdom	23	1.4k 1.6×	526 0.9×	259 1.0×	165 1.0×	336 2.3×	121	1.5k
Tommy R. Jensen Germany	7	481 0.6×	223 0.4×	71 0.3×	148 0.9×	143 1.0×	20	627
Jan Arne Telle Norway	16	720 0.8×	131 0.2×	82 0.3×	71 0.4×	343 2.3×	69	864
O. V. Borodin Russia	25	2.4k 2.8×	995 1.7×	200 0.8×	786 4.7×	226 1.5×	148	2.6k
Eric Mendelsohn Canada	16	200 0.2×	213 0.4×	86 0.3×	407 2.4×	47 0.3×	59	620
Bernard Ries France	12	275 0.3×	65 0.1×	30 0.1×	98 0.6×	143 1.0×	62	440
Marek Kubale Poland	14	302 0.3×	102 0.2×	30 0.1×	113 0.7×	251 1.7×	54	630
Donald L. Kreher United States	11	134 0.2×	163 0.3×	39 0.1×	311 1.8×	35 0.2×	62	529
Imrich Vrt’o Slovakia	12	270 0.3×	18 0.0×	29 0.1×	142 0.8×	149 1.0×	60	437

Countries citing papers authored by Zs. Tuza

Since Specialization

Citations

This map shows the geographic impact of Zs. Tuza's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Zs. Tuza with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Zs. Tuza more than expected).

Fields of papers citing papers by Zs. Tuza

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Zs. Tuza. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Zs. Tuza. The network helps show where Zs. Tuza may publish in the future.

Co-authorship network of co-authors of Zs. Tuza

This figure shows the co-authorship network connecting the top 25 collaborators of Zs. Tuza. A scholar is included among the top collaborators of Zs. Tuza based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Zs. Tuza. Zs. Tuza is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Bujtás, Csilla, Michał Karpiński, Yannis Manoussakis, et al.. (2018). Tropical dominating sets in vertex-coloured graphs. Journal of Discrete Algorithms. 48. 27–41. 3 indexed citations

Bacsó, Gábor, Zs. Tuza, & Margit Voigt. (2006). Characterization of graphs dominated by induced paths. Discrete Mathematics. 307(7-8). 822–826. 3 indexed citations

Tuza, Zs. & Margit Voigt. (2002). A note on planar 5-list colouring: non-extendability at distance 4. Discrete Mathematics. 251(1-3). 169–172. 6 indexed citations

Kratochvı́l, Jan & Zs. Tuza. (2000). On the complexity of bicoloring clique hypergraphs of graphs (extended abstract). Symposium on Discrete Algorithms. 40–41. 1 indexed citations

Schiermeyer, Ingo, Zs. Tuza, & Margit Voigt. (2000). On-line rankings of graphs. Discrete Mathematics. 212(1-2). 141–147. 8 indexed citations

Kratochvı́l, Jan, Zs. Tuza, & Margit Voigt. (1998). Complexity of choosing subsets from color sets. Discrete Mathematics. 191(1-3). 139–148. 3 indexed citations

Bondy, J. A. & Zs. Tuza. (1997). A weighted generalization of Turán's theorem. Journal of Graph Theory. 25(4). 267–275. 6 indexed citations

Dell’Olmo, Paolo, M. Grazia Speranza, & Zs. Tuza. (1997). Comparability graph augmentation for some multiprocessor scheduling problems. Discrete Applied Mathematics. 72(1-2). 71–84. 8 indexed citations

Tuza, Zs. & Margit Voigt. (1996). Every 2-choosable graph is (2 m, m )-choosable. Journal of Graph Theory. 22(3). 245–252. 13 indexed citations

10.

Clark, Lane, et al.. (1996). Cycle-saturated graphs of minimum size. Discrete Mathematics. 150(1-3). 31–48. 20 indexed citations

11.

Manoussakis, Yannis, et al.. (1994). Paths through fixed vertices in edge-colored graphs. SZTAKI Publication Repository (Hungarian Academy of Sciences). 127. 49–58. 29 indexed citations

12.

Hell, Pavol, Yannis Manoussakis, & Zs. Tuza. (1994). Packing problems in edge-colored graphs. Discrete Applied Mathematics. 52(3). 295–306. 7 indexed citations

13.

Hujter, Mihály & Zs. Tuza. (1993). PRECOLORING EXTENSION. II. GRAPHS CLASSES RELATED TO BIPARTITE GRAPHS. 62(1). 1–11. 39 indexed citations

14.

Hujter, Mihály, et al.. (1992). CROSS FERTILISATION OF GRAPH THEORY AND AIRCRAFT MAINTENANCE SCHEDULING. 3 indexed citations

15.

Erdös, P., D. Fon-Der-Flaass, Alexandr Kostochka, & Zs. Tuza. (1992). Small transversals in uniform hypergraphs. Siberian Advances in Mathematics. 2(1). 82–88. 5 indexed citations

16.

Bíró, Miklós, Mihály Hujter, & Zs. Tuza. (1992). Precoloring extension. I. Interval graphs. Discrete Mathematics. 100(1-3). 267–279. 81 indexed citations

17.

Chung, Fan, András Gyárfás, Zs. Tuza, & W. T. Trotter. (1990). The maximum number of edges in 2K2-free graphs of bounded degree. Discrete Mathematics. 81(2). 129–135. 61 indexed citations

18.

Gyárfás, András, Jenő Lehel, Jaroslav Nešetřil, et al.. (1987). Local k-colorings of graphs and hypergraphs. Journal of Combinatorial Theory Series B. 43(2). 127–139. 25 indexed citations

19.

Lehel, Jenő & Zs. Tuza. (1986). Neighborhood perfect graphs. Discrete Mathematics. 61(1). 93–101. 39 indexed citations

20.

Lehel, Jenő & Zs. Tuza. (1980). Ensembles d'articulation d'un graphe γ-critique. Discrete Mathematics. 30(3). 245–248. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact