Zsolt Tuza spends much of his time researching Combinatorics, Discrete mathematics, Graph, Chordal graph and Split graph. Bipartite graph, Complete coloring, Edge, Vertex and Graph power are the core of his Combinatorics study. His Discrete mathematics study combines topics in areas such as Chromatic scale and Order.
His work in the fields of Graph, such as Vertex, Rainbow connection, Strongly chordal graph and Rainbow connection number, overlaps with other areas such as Algorithmic complexity. His Chordal graph research integrates issues from Time complexity and Indifference graph. In his research, Clique problem and Treewidth is intimately related to K-tree, which falls under the overarching field of Split graph.
Zsolt Tuza focuses on Combinatorics, Discrete mathematics, Graph, Vertex and Hypergraph. His study brings together the fields of Upper and lower bounds and Combinatorics. The concepts of his Upper and lower bounds study are interwoven with issues in Bin and Bin packing problem.
His work in Split graph, Neighbourhood, 1-planar graph, Time complexity and Edge coloring are all subfields of Discrete mathematics research. His Edge coloring research also works with subjects such as
His primary areas of investigation include Combinatorics, Graph, Vertex, Conjecture and Bipartite graph. His study in Upper and lower bounds extends to Combinatorics with its themes. As part of one scientific family, Zsolt Tuza deals mainly with the area of Graph, narrowing it down to issues related to the Bounded function, and often Dominator, Graph property and Treewidth.
His research in Vertex intersects with topics in Spanning forest and Multigraph. His research on Conjecture concerns the broader Discrete mathematics. His Discrete mathematics study frequently draws connections between related disciplines such as Function.
Zsolt Tuza mostly deals with Combinatorics, Graph, Mathematical optimization, Job shop scheduling and Upper and lower bounds. His research related to Vertex, Parameterized complexity and Time complexity might be considered part of Combinatorics. His work on Domination analysis as part of general Graph study is frequently connected to Rainbow, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them.
Zsolt Tuza has researched Mathematical optimization in several fields, including Graph coloring and Infimum and supremum. His studies in Upper and lower bounds integrate themes in fields like Game theoretic, Mathematical economics, Nash equilibrium and Bin. Dominator is a subfield of Discrete mathematics that he studies.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Rankings of graphs
Hans L. Bodlaender;Jitender S. Deogun;Klaus Jansen;Ton Kloks.
workshop on graph theoretic concepts in computer science (1994)
Semi on-line algorithms for the partition problem
Hans Kellerer;Vladimir Kotov;Maria Grazia Speranza;Zsolt Tuza.
Operations Research Letters (1997)
On Rainbow Connection
Yair Caro;Arieh Lev;Yehuda Roditty;Zsolt Tuza.
Electronic Journal of Combinatorics (2008)
Maximum cuts and largest bipartite subgraphs.
Svatopluk Poljak;Zsolt Tuza.
Combinatorial Optimization (1993)
Complexity of Coloring Graphs without Forbidden Induced Subgraphs
Daniel Král;Jan Kratochvíl;Zsolt Tuza;Gerhard J. Woeginger.
workshop on graph theoretic concepts in computer science (2001)
On the b-Chromatic Number of Graphs
Jan Kratochvíl;Zsolt Tuza;Margit Voigt.
workshop on graph theoretic concepts in computer science (2002)
Induced matchings in bipartite graphs
R. Faudree;A. Gyárfas;R. H. Schelp;Z. Tuza.
Discrete Mathematics (1989)
Covering all cliques of a graph
Discrete Mathematics (1991)
Saturated graphs with minimal number of edges
L. Kászonyi;Zsolt Tuza.
Journal of Graph Theory (1986)
The number of maximal independent sets in triangle-free graphs
Mihály Hjuter;Zsolt Tuza.
SIAM Journal on Discrete Mathematics (1993)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
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: