| 2007 |
|---|
| 131 | EE | Csilla Bujtás,
Zsolt Tuza:
Orderings of uniquely colorable hypergraphs.
Discrete Applied Mathematics 155(11): 1395-1407 (2007) |
| 130 | EE | Mirko Hornák,
Zsolt Tuza,
Mariusz Wozniak:
On-line arbitrarily vertex decomposable trees.
Discrete Applied Mathematics 155(11): 1420-1429 (2007) |
| 129 | EE | Cristina Bazgan,
Zsolt Tuza,
Daniel Vanderpooten:
Efficient algorithms for decomposing graphs under degree constraints.
Discrete Applied Mathematics 155(8): 979-988 (2007) |
| 128 | EE | Gábor Bacsó,
Zsolt Tuza,
Margit Voigt:
Characterization of graphs dominated by induced paths.
Discrete Mathematics 307(7-8): 822-826 (2007) |
| 127 | EE | Mieczyslaw Borowiecki,
Elzbieta Sidorowicz,
Zsolt Tuza:
Game List Colouring of Graphs.
Electr. J. Comb. 14(1): (2007) |
| 2006 |
|---|
| 126 | EE | Cristina Bazgan,
Zsolt Tuza,
Daniel Vanderpooten:
The satisfactory partition problem.
Discrete Applied Mathematics 154(8): 1236-1245 (2006) |
| 125 | EE | Enrico Angelelli,
Maria Grazia Speranza,
Zsolt Tuza:
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks.
Discrete Mathematics & Theoretical Computer Science 8(1): 1-16 (2006) |
| 124 | EE | Cristina Bazgan,
Zsolt Tuza,
Daniel Vanderpooten:
Degree-constrained decompositions of graphs: Bounded treewidth and planarity.
Theor. Comput. Sci. 355(3): 389-395 (2006) |
| 2005 |
|---|
| 123 | EE | Cristina Bazgan,
Zsolt Tuza,
Daniel Vanderpooten:
Complexity and Approximation of Satisfactory Partition Problems.
COCOON 2005: 829-838 |
| 122 | EE | Zsolt Tuza:
Strong branchwidth and local transversals.
Discrete Applied Mathematics 145(2): 291-296 (2005) |
| 121 | EE | Betsy Crull,
Tammy Cundiff,
Paul Feltman,
Glenn H. Hurlbert,
Lara Pudwell,
Zsuzsanna Szaniszló,
Zsolt Tuza:
The cover pebbling number of graphs.
Discrete Mathematics 296(1): 15-23 (2005) |
| 120 | EE | Anja Kohl,
Jens Schreyer,
Zsolt Tuza,
Margit Voigt:
List version of L(d, s)-labelings.
Theor. Comput. Sci. 349(1): 92-98 (2005) |
| 2004 |
|---|
| 119 | EE | Renata Mansini,
Maria Grazia Speranza,
Zsolt Tuza:
Scheduling groups of tasks with precedence constraints on three dedicated processors.
Discrete Applied Mathematics 134(1-3): 141-168 (2004) |
| 118 | EE | Frank Göring,
Jochen Harant,
Erhard Hexel,
Zsolt Tuza:
On short cycles through prescribed vertices of a graph.
Discrete Mathematics 286(1-2): 67-74 (2004) |
| 117 | EE | Gaetano Quattrocchi,
Zsolt Tuza:
Partition of C 4-Designs into Minimum and Maximum Number of P 3-Designs.
Graphs and Combinatorics 20(4): 531-540 (2004) |
| 116 | EE | Enrico Angelelli,
Á. B. Nagy,
Maria Grazia Speranza,
Zsolt Tuza:
The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks.
J. Scheduling 7(6): 421-428 (2004) |
| 2003 |
|---|
| 115 | EE | Cristina Bazgan,
Zsolt Tuza,
Daniel Vanderpooten:
On the Existence and Determination of Satisfactory Partitions in a Graph.
ISAAC 2003: 444-453 |
| 114 | EE | Enrico Angelelli,
Maria Grazia Speranza,
Zsolt Tuza:
Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items.
Algorithmica 37(4): 243-262 (2003) |
| 113 | | Mieczyslaw Borowiecki,
Jaroslaw Grytczuk,
Mariusz Haluszczak,
Zsolt Tuza:
Schütte's Tournament Problem and Intersecting Families of Sets.
Combinatorics, Probability & Computing 12(4): 359-364 (2003) |
| 112 | | Maria Axenovich,
Tao Jiang,
Zsolt Tuza:
Local Anti-Ramsey Numbers of Graphs.
Combinatorics, Probability & Computing 12(5-6): 495-511 (2003) |
| 111 | EE | Lorenzo Milazzo,
Zsolt Tuza,
Vitaly I. Voloshin:
Strict colorings of Steiner triple and quadruple systems: a survey.
Discrete Mathematics 261(1-3): 399-411 (2003) |
| 110 | EE | Hal A. Kierstead,
Zsolt Tuza:
Marking Games and the Oriented Game Chromatic Number of Partial k-Trees.
Graphs and Combinatorics 19(1): 121-129 (2003) |
| 2002 |
|---|
| 109 | EE | Jan Kratochvíl,
Zsolt Tuza,
Margit Voigt:
On the b-Chromatic Number of Graphs.
WG 2002: 310-320 |
| 108 | | Gabor Bascó,
Zsolt Tuza:
Structural domination of graphs.
Ars Comb. 63: (2002) |
| 107 | EE | Zsolt Tuza,
Vitaly I. Voloshin,
Huishan Zhou:
Uniquely colorable mixed hypergraphs.
Discrete Mathematics 248(1-3): 221-236 (2002) |
| 106 | EE | Zsolt Tuza,
Margit Voigt:
A note on planar 5-list colouring: non-extendability at distance 4.
Discrete Mathematics 251(1-3): 169-172 (2002) |
| 105 | EE | Tao Jiang,
Dhruv Mubayi,
Zsolt Tuza,
Vitaly I. Voloshin,
Douglas B. West:
The Chromatic Spectrum of Mixed Hypergraphs.
Graphs and Combinatorics 18(2): 309-318 (2002) |
| 104 | EE | Jan Kratochvíl,
Zsolt Tuza:
On the complexity of bicoloring clique hypergraphs of graphs.
J. Algorithms 45(1): 40-54 (2002) |
| 103 | EE | Imre Z. Ruzsa,
Zsolt Tuza,
Margit Voigt:
Distance Graphs with Finite Chromatic Number.
J. Comb. Theory, Ser. B 85(1): 181-187 (2002) |
| 102 | EE | Cristina Bazgan,
Miklos Santha,
Zsolt Tuza:
Efficient Approximation Algorithms for the SUBSET-SUMS EQUALITY Problem.
J. Comput. Syst. Sci. 64(2): 160-170 (2002) |
| 2001 |
|---|
| 101 | EE | Daniel Král,
Jan Kratochvíl,
Zsolt Tuza,
Gerhard J. Woeginger:
Complexity of Coloring Graphs without Forbidden Induced Subgraphs.
WG 2001: 254-262 |
| 100 | EE | Anna Lee,
Gábor Révész,
Jenö Szigeti,
Zsolt Tuza:
Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs.
Discrete Mathematics 230(1-3): 49-61 (2001) |
| 99 | EE | Adam Idzik,
Zsolt Tuza:
Heredity properties of connectedness in edge-coloured complete graphs.
Discrete Mathematics 235(1-3): 301-306 (2001) |
| 98 | EE | Zsolt Tuza,
Annegret Wagler:
Minimally Non-Preperfect Graphs of Small Maximum Degree.
Graphs and Combinatorics 17(4): 759-773 (2001) |
| 97 | EE | Yannis Manoussakis,
Zsolt Tuza:
Ramsey numbers for tournaments.
Theor. Comput. Sci. 263(1-2): 75-85 (2001) |
| 2000 |
|---|
| 96 | EE | Jan Kratochvíl,
Zsolt Tuza:
On the complexity of bicoloring clique hypergraphs of graphs (extended abstract).
SODA 2000: 40-41 |
| 95 | EE | Zsolt Tuza,
Vitaly I. Voloshin:
Uncolorable Mixed Hypergraphs.
Discrete Applied Mathematics 99(1-3): 209-227 (2000) |
| 94 | EE | Ingo Schiermeyer,
Zsolt Tuza,
Margit Voigt:
On-line rankings of graphs.
Discrete Mathematics 212(1-2): 141-147 (2000) |
| 93 | EE | Zsolt Tuza:
Extremal bi-Helly families.
Discrete Mathematics 213(1-3): 321-331 (2000) |
| 92 | EE | Mihály Hujter,
László Spissich,
Zsolt Tuza:
Sharpness of Some Intersection Theorems.
Eur. J. Comb. 21(7): 913-916 (2000) |
| 1999 |
|---|
| 91 | EE | Stanislaw Bylka,
Adam Idzik,
Zsolt Tuza:
Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdös inequality.
Discrete Mathematics 194(1-3): 39-58 (1999) |
| 90 | EE | Stanislav Jendrol,
Tomás Madaras,
Roman Sotak,
Zsolt Tuza:
On light cycles in plane triangulations.
Discrete Mathematics 197-198: 453-467 (1999) |
| 89 | EE | Salvatore Milici,
Zsolt Tuza:
Disjoint blocking sets in cycle systems.
Discrete Mathematics 208-209: 451-462 (1999) |
| 88 | | Cristina Bazgan,
Miklos Santha,
Zsolt Tuza:
On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs.
J. Algorithms 31(1): 249-268 (1999) |
| 87 | | Abdel Krim Amoura,
Evripidis Bampis,
Yannis Manoussakis,
Zsolt Tuza:
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors.
Parallel Computing 25(1): 49-61 (1999) |
| 86 | EE | Jan Kratochvíl,
Zsolt Tuza:
Rankings of Directed Graphs.
SIAM J. Discrete Math. 12(3): 374-384 (1999) |
| 1998 |
|---|
| 85 | EE | Cristina Bazgan,
Miklos Santha,
Zsolt Tuza:
Efficient Approximation Algorithms for the Subset-Sums Equality Problem.
ICALP 1998: 387-396 |
| 84 | | Cristina Bazgan,
Miklos Santha,
Zsolt Tuza:
On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract).
STACS 1998: 276-286 |
| 83 | | Jan Kratochvíl,
Zsolt Tuza:
Rankings of Directed Graphs.
WG 1998: 114-123 |
| 82 | EE | Lorenzo Milazzo,
Zsolt Tuza:
Strict colourings for classes of steiner triple systems.
Discrete Mathematics 182(1-3): 233-243 (1998) |
| 81 | EE | Jan Kratochvíl,
Zsolt Tuza,
Margit Voigt:
Complexity of choosing subsets from color sets.
Discrete Mathematics 191(1-3): 139-148 (1998) |
| 80 | EE | Paolo Dell'Olmo,
Hans Kellerer,
Maria Grazia Speranza,
Zsolt Tuza:
A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins.
Inf. Process. Lett. 65(5): 229-233 (1998) |
| 79 | EE | Hans L. Bodlaender,
Jitender S. Deogun,
Klaus Jansen,
Ton Kloks,
Dieter Kratsch,
Haiko Müller,
Zsolt Tuza:
Rankings of Graphs.
SIAM J. Discrete Math. 11(1): 168-181 (1998) |
| 1997 |
|---|
| 78 | | John G. Gimbel,
Michael A. Henning,
Zsolt Tuza:
Switching Distance Graphs.
Ars Comb. 47: (1997) |
| 77 | EE | Paolo Dell'Olmo,
Maria Grazia Speranza,
Zsolt Tuza:
Comparability Graph Augmentation for some Multiprocessor Scheduling Problems.
Discrete Applied Mathematics 72(1-2): 71-84 (1997) |
| 76 | EE | Zsolt Tuza,
Margit Voigt:
List Colorings and Reducibility.
Discrete Applied Mathematics 79(1-3): 247-256 (1997) |
| 75 | EE | Paolo Dell'Olmo,
Maria Grazia Speranza,
Zsolt Tuza:
Efficiency and effectiveness of normal schedules on three dedicated processors.
Discrete Mathematics 164(1-3): 67-79 (1997) |
| 74 | EE | Noga Alon,
Zsolt Tuza,
Margit Voigt:
Choosability and fractional chromatic numbers.
Discrete Mathematics 165-166: 31-38 (1997) |
| 73 | EE | Mario Gionfriddo,
Frank Harary,
Zsolt Tuza:
The color cost of a caterpillar.
Discrete Mathematics 174(1-3): 125-130 (1997) |
| 72 | EE | Lorenzo Milazzo,
Zsolt Tuza:
Upper chromatic number of Steiner triple and quadruple systems.
Discrete Mathematics 174(1-3): 247-259 (1997) |
| 71 | EE | Hans Kellerer,
Vladimir Kotov,
Maria Grazia Speranza,
Zsolt Tuza:
Semi on-line algorithms for the partition problem.
Oper. Res. Lett. 21(5): 235-242 (1997) |
| 1996 |
|---|
| 70 | | Mihály Hujter,
Zsolt Tuza:
Precoloring Extension 3: Classes of Perfect Graphs.
Combinatorics, Probability & Computing 5: 35-56 (1996) |
| 69 | EE | Yannis Manoussakis,
Zsolt Tuza:
The Forwarding Index of Directed Networks.
Discrete Applied Mathematics 68(3): 279-291 (1996) |
| 68 | EE | Stanislav Jendrol,
Michal Tkác,
Zsolt Tuza:
The irregularity strength and cost of the union of cliques.
Discrete Mathematics 150(1-3): 179-186 (1996) |
| 67 | EE | Curtis A. Barefoot,
L. H. Clark,
Roger C. Entringer,
T. D. Porter,
László A. Székely,
Zsolt Tuza:
Cycle-saturated graphs of minimum size.
Discrete Mathematics 150(1-3): 31-48 (1996) |
| 66 | EE | Paul Erdös,
Tibor Gallai,
Zsolt Tuza:
Covering and independence in triangle structures.
Discrete Mathematics 150(1-3): 89-101 (1996) |
| 65 | EE | René van Dal,
Gert A. Tijssen,
Zsolt Tuza,
Jack A. A. van der Veen,
Christina Zamfirescu,
Tudor Zamfirescu:
Hamiltonian properties of Toeplitz graphs.
Discrete Mathematics 159(1-3): 69-81 (1996) |
| 64 | EE | Paul Erdös,
Zsolt Tuza,
Pavel Valtr:
Ramsey-remainder.
Eur. J. Comb. 17(6): 519-532 (1996) |
| 63 | EE | Yannis Manoussakis,
Zsolt Tuza:
Optimal routings in communication networks with linearly bounded forwarding index.
Networks 28(4): 177-180 (1996) |
| 1995 |
|---|
| 62 | EE | Nguyen Van Ngoc,
Zsolt Tuza:
4-chromatic graphs with large odd girth.
Discrete Mathematics 138(1-3): 387-392 (1995) |
| 61 | EE | Martin Aigner,
Eberhard Triesch,
Zsolt Tuza:
Searching for acyclic orientations of graphs.
Discrete Mathematics 144(1-3): 3-10 (1995) |
| 60 | | Noga Alon,
Zsolt Tuza:
The Acyclic Orientation Game on Random Graphs.
Random Struct. Algorithms 6(2/3): 261-268 (1995) |
| 59 | | Zsolt Tuza:
How to Make A Random Graph Irregular.
Random Struct. Algorithms 6(2/3): 323-330 (1995) |
| 1994 |
|---|
| 58 | | Hans L. Bodlaender,
Jitender S. Deogun,
Klaus Jansen,
Ton Kloks,
Dieter Kratsch,
Haiko Müller,
Zsolt Tuza:
Ranking of Graphs.
WG 1994: 292-304 |
| 57 | | Mario Gionfriddo,
Salvatore Milici,
Zsolt Tuza:
Blocking Sets in SQS(2u).
Combinatorics, Probability & Computing 3: 77-86 (1994) |
| 56 | | Jan Kratochvíl,
Zsolt Tuza:
Algorithmic complexity of list colorings.
Discrete Applied Mathematics 50(3): 297-302 (1994) |
| 55 | EE | Zsolt Tuza:
Inequalities for Minimal Covering Sets in Set Systems of Given Rank.
Discrete Applied Mathematics 51(1-2): 187-195 (1994) |
| 54 | EE | Pavol Hell,
Yannis Manoussakis,
Zsolt Tuza:
Packing Problems in Edge-colored Graphs.
Discrete Applied Mathematics 52(3): 295-306 (1994) |
| 53 | EE | Mario Gionfriddo,
Zsolt Tuza:
On conjectures of Berge and Chvátal.
Discrete Mathematics 124(1-3): 79-86 (1994) |
| 52 | EE | Zsolt Tuza:
Monochromatic coverings and tree Ramsey numbers.
Discrete Mathematics 125(1-3): 377-384 (1994) |
| 51 | EE | Zsolt Tuza:
Largest size and union of Helly families.
Discrete Mathematics 127(1-3): 319-327 (1994) |
| 50 | EE | Salvatore Milici,
Zsolt Tuza:
The spectrum of lambda-times repeated blocks for TS(upsilon, lambda).
Discrete Mathematics 129(1-3): 159-166 (1994) |
| 49 | EE | Zsolt Tuza:
Characterization of (m, 1)-transitive and (3, 2)-transitive semi-complete directed graphs.
Discrete Mathematics 135(1-3): 335-347 (1994) |
| 48 | EE | Svatopluk Poljak,
Zsolt Tuza:
Bipartite Subgraphs of Triangle-Free Graphs.
SIAM J. Discrete Math. 7(2): 307-313 (1994) |
| 1993 |
|---|
| 47 | | Nguyen Van Ngoc,
Zsolt Tuza:
Linear-Time Algorithms for the Max Cut Problem.
Combinatorics, Probability & Computing 2: 201-210 (1993) |
| 46 | EE | Gabor Bascó,
Zsolt Tuza:
Domination properties and induced subgraphs.
Discrete Mathematics 111(1-3): 37-40 (1993) |
| 45 | EE | Yair Caro,
Zsolt Tuza:
Bounded degrees and prescribed distances in graphs.
Discrete Mathematics 111(1-3): 87-93 (1993) |
| 44 | EE | Zsolt Tuza:
Multipartite Turán problem for connected graphs and hypergraphs.
Discrete Mathematics 112(1-3): 199-206 (1993) |
| 43 | EE | Zoltán Blázsik,
Mihály Hujter,
András Pluhár,
Zsolt Tuza:
Graphs with no induced C4 and 2K2.
Discrete Mathematics 115(1-3): 51-55 (1993) |
| 42 | EE | László Pyber,
Zsolt Tuza:
Menger-type theorems with restrictions on path lengths.
Discrete Mathematics 120(1-3): 161-174 (1993) |
| 41 | EE | Peter Horák,
Zsolt Tuza:
Large s-representable set systems with low maximum degree.
Discrete Mathematics 122(1-3): 205-217 (1993) |
| 40 | | Zsolt Tuza:
Helly Property in Finite Set Systems.
J. Comb. Theory, Ser. A 62(1): 1-14 (1993) |
| 39 | | Jan Kratochvíl,
Petr Savický,
Zsolt Tuza:
One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete.
SIAM J. Comput. 22(1): 203-210 (1993) |
| 38 | | Gerhard J. Chang,
Martin Farber,
Zsolt Tuza:
Algorithmic Aspects of Neighborhood Numbers.
SIAM J. Discrete Math. 6(1): 24-29 (1993) |
| 37 | | Mihály Hujter,
Zsolt Tuza:
The Number of Maximal Independent Sets in Triangle-Free Graphs.
SIAM J. Discrete Math. 6(2): 284-288 (1993) |
| 1992 |
|---|
| 36 | | János Körner,
Gábor Simonyi,
Zsolt Tuza:
Perfect couples of graphs.
Combinatorica 12(2): 179-192 (1992) |
| 35 | EE | M. Biró,
Mihály Hujter,
Zsolt Tuza:
Precoloring extension. I. Interval graphs.
Discrete Mathematics 100(1-3): 267-279 (1992) |
| 34 | EE | Miroslaw Truszczynski,
Zsolt Tuza:
Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets.
Discrete Mathematics 103(3): 301-312 (1992) |
| 33 | EE | Paul Erdös,
Tibor Gallai,
Zsolt Tuza:
Covering the cliques of a graph with vertices.
Discrete Mathematics 108(1-3): 279-289 (1992) |
| 32 | EE | Zsolt Tuza:
Asymptotic growth of sparse saturated structures is locally determined.
Discrete Mathematics 108(1-3): 397-402 (1992) |
| 31 | EE | Zsolt Tuza:
Graph coloring in linear time.
J. Comb. Theory, Ser. B 55(2): 236-243 (1992) |
| 30 | | Vojtech Rödl,
Zsolt Tuza:
Rainbow Subgraphs in Properly Edge-colored Graphs.
Random Struct. Algorithms 3(2): 175-182 (1992) |
| 1991 |
|---|
| 29 | EE | Miroslaw Truszczynski,
Zsolt Tuza:
Asymptotic results on saturated graphs.
Discrete Mathematics 87(3): 309-314 (1991) |
| 28 | EE | Thomas Andreae,
Martin Schughart,
Zsolt Tuza:
Clique-transversal sets of line graphs and complements of line graphs.
Discrete Mathematics 88(1): 11-20 (1991) |
| 27 | EE | Michael S. Jacobson,
Miroslaw Truszczynski,
Zsolt Tuza:
Decompositions of regular bipartite graphs.
Discrete Mathematics 89(1): 17-27 (1991) |
| 26 | EE | Paul Erdös,
Zoltán Füredi,
Zsolt Tuza:
Saturated r-uniform hypergraphs.
Discrete Mathematics 98(2): 95-104 (1991) |
| 25 | EE | Paul Erdös,
András Hajnal,
Zsolt Tuza:
Local constraints ensuring small representing sets.
J. Comb. Theory, Ser. A 58(1): 78-84 (1991) |
| 24 | EE | Yair Caro,
Zsolt Tuza:
Hypergraph coverings and local colorings.
J. Comb. Theory, Ser. B 52(1): 79-85 (1991) |
| 23 | EE | Zsolt Tuza:
Extensions of Gallai's graph covering theorems for uniform hypergraphs.
J. Comb. Theory, Ser. B 52(1): 92-96 (1991) |
| 22 | | Martin J. M. de Boer,
Aristid Lindenmayer,
Zsolt Tuza:
A Periodic Division Pattern that Cannot be Generated by D0L Systems.
Theor. Comput. Sci. 83(2): 205-218 (1991) |
| 1990 |
|---|
| 21 | EE | Fan R. K. Chung,
András Gyárfás,
Zsolt Tuza,
William T. Trotter:
The maximum number of edges in 2K2-free graphs of bounded degree.
Discrete Mathematics 81(2): 129-135 (1990) |
| 20 | EE | Zsolt Tuza:
Covering all cliques of a graph.
Discrete Mathematics 86(1-3): 117-126 (1990) |
| 19 | | Zsolt Tuza:
Periodic String Division Generated by Deterministic L Systems.
Inf. Process. Lett. 34(5): 229-234 (1990) |
| 18 | | Yannis Manoussakis,
Zsolt Tuza:
Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments.
SIAM J. Discrete Math. 3(4): 537-543 (1990) |
| 1989 |
|---|
| 17 | EE | Ralph J. Faudree,
András Gyárfás,
Richard H. Schelp,
Zsolt Tuza:
Induced matchings in bipartite graphs.
Discrete Mathematics 78(1-2): 83-87 (1989) |
| 16 | EE | Svatopluk Poljak,
Zsolt Tuza:
On the maximum number of qualitatively independent partitions.
J. Comb. Theory, Ser. A 51(1): 111-116 (1989) |
| 15 | EE | Zsolt Tuza:
Minimum number of elements representing a set system of given rank.
J. Comb. Theory, Ser. A 52(1): 84-89 (1989) |
| 14 | EE | Paul Erdös,
János Pach,
Richard Pollack,
Zsolt Tuza:
Radius, diameter, and minimum degree.
J. Comb. Theory, Ser. B 47(1): 73-79 (1989) |
| 1988 |
|---|
| 13 | EE | Zsolt Tuza:
Isomorphism of two infinite-chromatic triangle-free graphs.
Discrete Mathematics 69(1): 95 (1988) |
| 12 | EE | András Gyárfás,
Jenö Lehel,
Zsolt Tuza:
Clumsy packing of dominoes.
Discrete Mathematics 71(1): 33-46 (1988) |
| 1987 |
|---|
| 11 | EE | András Gyárfás,
Zsolt Tuza:
An upper bound on the Ramsey number of trees.
Discrete Mathematics 66(3): 309-310 (1987) |
| 10 | EE | András Gyárfás,
Jenö Lehel,
Jaroslav Nesetril,
Vojtech Rödl,
Richard H. Schelp,
Zsolt Tuza:
Local k-colorings of graphs and hypergraphs.
J. Comb. Theory, Ser. B 43(2): 127-139 (1987) |
| 1986 |
|---|
| 9 | | Zsolt Tuza:
Some combinatorial problems concerning finite languages.
IMYCS 1986: 51-58 |
| 8 | EE | Jenö Lehel,
Zsolt Tuza:
Neighborhood perfect graphs.
Discrete Mathematics 61(1): 93-101 (1986) |
| 1985 |
|---|
| 7 | | András Gyárfás,
Jenö Lehel,
Zsolt Tuza:
How many atoms can be defined by boxes.
Combinatorica 5(3): 193-204 (1985) |
| 6 | EE | Zoltán Füredi,
Zsolt Tuza:
Hypergraphs without a large star.
Discrete Mathematics 55(3): 317-321 (1985) |
| 5 | EE | Vojtech Rödl,
Zsolt Tuza:
On color critical graphs.
J. Comb. Theory, Ser. B 38(3): 204-213 (1985) |
| 4 | EE | Zsolt Tuza:
Critical hypergraphs and intersecting set-pair systems.
J. Comb. Theory, Ser. B 39(2): 134-145 (1985) |
| 1984 |
|---|
| 3 | | Zsolt Tuza:
Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices.
Combinatorica 4(1): 111-116 (1984) |
| 2 | EE | András Gyárfás,
Jenö Lehel,
Zsolt Tuza:
The structure of rectangle families dividing the plane into maximum number of atoms.
Discrete Mathematics 52(2-3): 177-198 (1984) |
| 1982 |
|---|
| 1 | EE | Jenö Lehel,
Zsolt Tuza:
Triangle-free partial graphs and edge covering theorems.
Discrete Mathematics 39(1): 59-65 (1982) |
