Z
Zsolt Tuza
Researcher at University of Pannonia
Publications - 339
Citations - 6278
Zsolt Tuza is an academic researcher from University of Pannonia. The author has contributed to research in topics: Vertex (geometry) & Chordal graph. The author has an hindex of 40, co-authored 325 publications receiving 5834 citations. Previous affiliations of Zsolt Tuza include Courant Institute of Mathematical Sciences & Alfréd Rényi Institute of Mathematics.
Papers
More filters
Journal ArticleDOI
On Rainbow Connection
TL;DR: This paper proves several non-trivial upper bounds for $rc(G)$, as well as determine sufficient conditions that guarantee that if $G$ is a connected graph with $n$ vertices and with minimum degree $3$ then $rc (G)=2$.
Book ChapterDOI
Complexity of Coloring Graphs without Forbidden Induced Subgraphs
TL;DR: A complete characterization of parameter graphs H for which the problem of coloring H-free graphs is polynomial and for which it is NP-complete is given.
Journal ArticleDOI
Semi on-line algorithms for the partition problem
TL;DR: Three different semi on-line versions of the partition problem are investigated and one has a worst-case ratio of 43 which is shown to be the best possible worst- case ratio.
Journal ArticleDOI
Saturated graphs with minimal number of edges
L. Kászonyi,Zsolt Tuza +1 more
TL;DR: The minimal number of edges in F-saturated graphs is examined and general estimations are given and the structure of minimal graphs is described for some special forbidden graphs (stars, paths, m pairwise disjoint edges).
Journal ArticleDOI
Rankings of Graphs
Hans L. Bodlaender,Jitender S. Deogun,Klaus Jansen,Ton Kloks,Dieter Kratsch,Haiko Müller,Zsolt Tuza +6 more
TL;DR: It is shown that the vertex ranking number $\chi_{r}(G)$ can be computed in polynomial time when restricted to graphs with treewidth at most k for any fixed k.