Źsolt Tuza

4.7k citations
225 papers · 2.5k indexed · h-index 24
Topics
Advanced Graph Theory Research (142 papers)Limits and Structures in Graph Theory (94 papers)Graph Labeling and Dimension Problems (68 papers)

In The Last Decade

Źsolt Tuza

209 papers receiving 2.3k citations

Peers

Źsolt Tuza
Comparison fields: 5 of 75
  • Computational Theory and Mathematics 1.8k
  • Discrete Mathematics and Combinatorics 995
  • Electrical and Electronic Engineering 608
  • Computer Networks and Communications 500
  • Geometry and Topology 489
Replace Martin Charles Golumbic with:
Martin Charles Golumbic Israel
Peter J. Slater United States
Douglas B. West United States
Jayme L. Szwarcfiter Brazil
Gerard J. Chang Taiwan
E. J. Cockayne Canada
Gábor Tardos Hungary
Michele Conforti Italy
Daniel Lokshtanov Norway
Saket Saurabh India
Źsolt Tuza relative to Martin Charles Golumbic Israel Martin Charles Golumbic's profile →
Citations per field
00.5×2.5×
Martin Charles Golumbic · 1×
Citations per year

Countries citing papers authored by Źsolt Tuza

Since Specialization
Citations

This map shows the geographic impact of Źsolt 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 Źsolt Tuza with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Źsolt Tuza more than expected).

Fields of papers citing papers by Źsolt Tuza

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Źsolt 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 Źsolt Tuza. The network helps show where Źsolt Tuza may publish in the future.

Co-authorship network of co-authors of Źsolt Tuza

This figure shows the co-authorship network connecting the top 25 collaborators of Źsolt Tuza. A scholar is included among the top collaborators of Źsolt 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 Źsolt Tuza. Źsolt Tuza is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
#WorkIndexed citations
1 1
2 3
3
ℤ 2 × ℤ 2-Cordial Cycle-Free Hypergraphs
1
4 5
5 7
6 59
7 64
8
A note on graphs with prescribed complete coloring numbers
0
9
Voloshin's conjecture for C-perfect hypertrees.
3
10
Logartihmic upper bound for the upper chromatic number of S(t, t+1, v) systems.
3
11 7
12
New challenges in the theory of hypergraph coloring
3
13 6
14 3
15
Computational Aspects of Connectionist Interaction Information Retrieval
1
16
Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types
1
17
Structural domination of graphs.
8
18 19
19 2
20
$C_4$-saturated graphs of minimum size
31

About Źsolt Tuza

Źsolt Tuza is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology, having authored 225 papers that have together received 2.5k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (142 papers), Limits and Structures in Graph Theory (94 papers) and Graph Labeling and Dimension Problems (68 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (995 citations), Computational Theory and Mathematics (1.8k citations) and Geometry and Topology (489 citations). Źsolt Tuza has collaborated with scholars based in Hungary, United States and Italy. Frequent co-authors include Csilla Bujtás, M. Grazia Speranza, Yair Caro, Svatopluk Poljak, Gábor Bacsó, Hans Kellerer, György Dósa, Cristina Bazgan, Vitaly Voloshin and Lorenzo Milazzo. Their work appears in journals such as SHILAP Revista de lepidopterología, European Journal of Operational Research and Computer Physics Communications.

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

Rankless by CCL
2026