World's Best Scientists 2026 revealed!
Award Badge
Computer Science
Hungary
2026

D-Index & Metrics

Computer Science

D-Index
50
Citations
9239
World Ranking
5647
National Ranking
3

Mathematics

D-Index
51
Citations
9457
World Ranking
1032
National Ranking
6

Research.com Recognitions

  • 2026 - Research.com Computer Science in Hungary Leader Award
  • 2025 - Research.com Computer Science in Hungary Leader Award
  • 2022 - Research.com Computer Science in Hungary Leader Award

Overview

Zsolt Tuza is affiliated with the University of Pannonia in Hungary and has a significant presence in the fields of computer science and mathematics. Their research primarily focuses on graph theory and related areas within discrete mathematics.

The main fields of study for their work include:

  • Computer Science
  • Mathematics

Within these broad fields, their subfields of study are:

  • Computational Theory and Mathematics
  • Discrete Mathematics and Combinatorics
  • Geometry and Topology
  • Industrial and Manufacturing Engineering
  • Electrical and Electronic Engineering

The topics Zsolt Tuza has focused on cover a range within graph theory and topology:

  • Advanced Graph Theory Research
  • Limits and Structures in Graph Theory
  • Graph Labeling and Dimension Problems
  • Graph theory and applications
  • graph theory and CDMA systems
  • Finite Group Theory Research
  • Advanced Topology and Set Theory

Among recent papers authored or co-authored by Zsolt Tuza are:

  • On Specific Factors in Graphs, 2020, published in Graphs and Combinatorics
  • On Grundy Total Domination Number in Product Graphs, 2021, published in DOAJ (DOAJ: Directory of Open Access Journals)
  • Strong Edge Coloring of Cayley Graphs and Some Product Graphs, 2022, published in Graphs and Combinatorics
  • Hypercycle Systems of 5-Cycles in Complete 3-Uniform Hypergraphs, 2021, published in Mathematics
  • Realization of digraphs in Abelian groups and its consequences, 2021, published in Journal of Graph Theory

The frequency of publication in academic venues shows a pattern of focus in several journals and repositories:

  • arXiv (Cornell University) with 23 publications
  • Discrete Mathematics with 6 publications
  • European Journal of Combinatorics with 5 publications
  • Graphs and Combinatorics with 4 publications
  • Mathematics with 3 publications

Zsolt Tuza collaborates frequently with several researchers, notably:

  • Balázs Patkós
  • Máté Vizer
  • Yair Caro
  • Csilla Bujtás
  • György Dósa

Best Publications

  • Graph colorings with local constraints - a survey

    Zsolt Tuza

  • Semi on-line algorithms for the partition problem

    Hans Kellerer;Vladimir Kotov;Maria Grazia Speranza;Zsolt Tuza

  • Rankings of graphs

    H. L. Bodlaender;Jitender S Deogun;K. Jansen;T. Kloks

  • On Rainbow Connection

    Yair Caro;Arieh Lev;Yehuda Roditty;Zsolt Tuza

  • Complexity of Coloring Graphs without Forbidden Induced Subgraphs

    Daniel Král;Jan Kratochvíl;Zsolt Tuza;Gerhard J. Woeginger

  • Saturated graphs with minimal number of edges

    L. Kászonyi;Zsolt Tuza

  • On the b-Chromatic Number of Graphs

    Jan Kratochvíl;Zsolt Tuza;Margit Voigt

  • Rankings of Graphs

    Hans L. Bodlaender;Jitender S. Deogun;Klaus Jansen;Ton Kloks

  • Maximum cuts and largest bipartite subgraphs.

    Svatopluk Poljak;Zsolt Tuza

  • Induced matchings in bipartite graphs

    R. Faudree;A. Gyárfas;R. H. Schelp;Z. Tuza

  • Covering all cliques of a graph

    Zsolt Tuza

  • Proper connection of graphs

    Valentin Borozan;Shinya Fujita;Aydin Gerek;Colton Magnant

  • The number of maximal independent sets in triangle-free graphs

    Mihály Hjuter;Zsolt Tuza

  • Radius, diameter, and minimum degree

    P. Erdős;Janos Pach;R. Pollack;Zsolt Tuza

  • The maximum number of edges in 2 K 2 -free graphs of bounded degree

    F. R. K. Chung;A. Gyárfás;Z. Tuza;W. T. Trotter

  • Precoloring Extension III: Classes of Perfect Graphs

    Mihály Hujter;Zsolt Tuza

  • Irregular assignments and vertex-distinguishing edge-colorings of graphs

    M. Aigner;E. Triesch;Zsolt Tuza

  • Covering the cliques of a graph with vertices

    Paul Erdős;Tibor Gallai;Zsolt Tuza

  • Improved lower bounds on k-independence

    Yair Caro;Zsolt Tuza

  • Clique-transversal sets of line graphs and complements of line graphs

    Thomas Andreae;Zsolt Tuza;Martin Schughart

  • One more occurrence of variables makes satisfiability jump from trivial to NP-complete

    Jan Kratochvíl;Petr Savický;Zsolt Tuza

  • Algorithmic complexity of list colorings

    Jan Kratochivíl;Zsolt Tuza

Frequent Co-Authors

Jan Kratochvíl
Jan Kratochvíl Charles University
Daniel Vanderpooten
Daniel Vanderpooten Paris Dauphine University
Svatopluk Poljak
Svatopluk Poljak Emory University
Michael A. Henning
Michael A. Henning University of Johannesburg
Miroslaw Truszczynski
Miroslaw Truszczynski University of Kentucky
Hans Kellerer
Hans Kellerer University of Graz
Anders Yeo
Anders Yeo University of Southern Denmark
Dieter Kratsch
Dieter Kratsch University of Lorraine
Klaus Jansen
Klaus Jansen Kiel University
Hans L. Bodlaender
Hans L. Bodlaender Utrecht University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students interested in Mathematics and its applications, exploring related online degrees can broaden career opportunities. Many professionals complement their math skills with business knowledge through programs like the fastest mba online options, which allow swift advancement without sacrificing quality.

Marketing analytics is another growing field where math expertise is valuable. Pursuing an ms in digital marketing degree cost usa can be an affordable way to gain knowledge in data-driven marketing strategies that pair well with strong mathematical backgrounds.

For those seeking MBA credentials, one year mba programs offer an accelerated path, perfect for math professionals aiming to quickly combine business acumen with technical skills.

Additionally, flexibility is important when choosing a program. Many institutions provide online mba transfer credits, which can shorten your study time and reduce costs by recognizing prior coursework.

Best Scientists Citing Zsolt Tuza

Trending Scientists

Recently Published Articles