Zsolt Tuza
Zsolt Tuza
MTA Rényi Institute, Budapest & University of Pannonia, Veszprém
Verifierad e-postadress på dcs.uni-pannon.hu
TitelCiteras avÅr
Graph coloring with local constraints-A survey
Z Tuza
Semi on-line algorithms for the partition problem
H Kellerer, V Kotov, MG Speranza, Z Tuza
Operations Research Letters 21 (5), 235-242, 1997
Maximum cuts and large bipartite subgraphs
S Poljak, Z Tuza
DIMACS Series 20, 181-244, 1995
Rankings of graphs
H Bodlaender, J Deogun, K Jansen, T Kloks, D Kratsch, H Müller, Z Tuza
Graph-Theoretic Concepts in Computer Science, 292-304, 1995
On rainbow connection
Y Caro, A Lev, Y Roditty, Z Tuza, R Yuster
the electronic journal of combinatorics 15 (1), 57, 2008
The strong chromatic index of graphs
RJ Faudree, RH Schelp, A Gyárfás, Z Tuza
Ars Combinatoria 29, 205-211, 1990
Precoloring extension
M Biró, M Hujter, Z Tuza
Preprint (Computer and Automation Institute, Budapest, 1990), 1990
On the b-chromatic number of graphs
J Kratochvíl, Z Tuza, M Voigt
International Workshop on Graph-Theoretic Concepts in Computer Science, 310-320, 2002
Complexity of coloring graphs without forbidden induced subgraphs
D Král’, J Kratochvíl, Z Tuza, G Woeginger
Graph-Theoretic Concepts in Computer Science, 254-262, 2001
Induced matchings in bipartite graphs
RJ Faudree, A Gyárfás, RH Schelp, Z Tuza
Discrete Mathematics 78 (1-2), 83-87, 1989
Covering all cliques of a graph
Z Tuza
Discrete Mathematics 86 (1-3), 117-126, 1990
Dominating cliques in P5-free graphs
G Bacsó, Z Tuza
Periodica Mathematica Hungarica 21 (4), 303-308, 1990
Saturated graphs with minimal number of edges
L Kászonyi, Z Tuza
Journal of graph theory 10 (2), 203-210, 1986
The number of maximal independent sets in triangle-free graphs
M Hujtera, Z Tuza
SIAM Journal on Discrete Mathematics 6 (2), 284-288, 1993
Precoloring extension. III. Classes of perfect graphs
M Hujter, Z Tuza
Combinatorics, Probability and Computing 5 (1), 35-56, 1996
Precoloring extension. II. Graph classes related to bipartite graphs
M Hujter, Z Tuza
Acta Mathematica Universitatis Comenianae 62 (1), 1-11, 1993
High rate fingerprinting codes and the fingerprinting capacity
E Amiri, G Tardos
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
Irregular assignments and vertex-distinguishing edge-colorings of graphs
M Aigner, E Triesch, Z Tuza
Annals of Discrete Mathematics 52, 1-9, 1992
The maximum number of edges in 2K2-free graphs of bounded degree
FRK Chung, A Gyárfás, Z Tuza, WT Trotter
Discrete Mathematics 81 (2), 129-135, 1990
Radius, diameter, and minimum degree
P Erdős, J Pach, R Pollack, Z Tuza
Journal of Combinatorial Theory, Series B 47 (1), 73-79, 1989
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20