Zsolt Tuza

According to our database1, Zsolt Tuza authored at least 289 papers between 1980 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.



In proceedings 
PhD thesis 



On csauthors.net:


Safe sets, network majority on weighted trees.
Networks, 2018

Tropical dominating sets in vertex-coloured graphs.
J. Discrete Algorithms, 2018

Safe sets in graphs: Graph classes and structural parameters.
J. Comb. Optim., 2018

A note on the polytope of bipartite TSP.
Discrete Applied Mathematics, 2018

Multiprofessor scheduling.
Discrete Applied Mathematics, 2018

Tight upper bounds for semi-online scheduling on two uniform machines with known optimum.
CEJOR, 2018

A General Bin Packing Game: Interest Taken into Account.
Algorithmica, 2018

Partition-Crossing Hypergraphs.
Acta Cybern., 2018

Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy.
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

Graph labeling games.
Electronic Notes in Discrete Mathematics, 2017

Tropical matchings in vertex-colored graphs.
Electronic Notes in Discrete Mathematics, 2017

Bounds on the game transversal number in hypergraphs.
Eur. J. Comb., 2017

The minimum number of vertices in uniform hypergraphs with given domination number.
Discrete Mathematics, 2017

Coloring the cliques of line graphs.
Discrete Mathematics, 2017

Grundy dominating sequences and zero forcing sets.
Discrete Optimization, 2017

A combinatorial problem related to sparse systems of equations.
Des. Codes Cryptography, 2017

F-WORM colorings: Results for 2-connected graphs.
Discrete Applied Mathematics, 2017

On the Complexity of Finding a Potential Community.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

New models of graph-bin packing.
Theor. Comput. Sci., 2016

Transversal Game on Hypergraphs and the 3/4-Conjecture on the Total Domination Game.
SIAM J. Discrete Math., 2016

Network Majority on Tree Topological Network.
Electronic Notes in Discrete Mathematics, 2016

K3-WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum.
Discussiones Mathematicae Graph Theory, 2016

Some properties of vertex-oblique graphs.
Discrete Mathematics, 2016

The Disjoint Domination Game.
Discrete Mathematics, 2016

Induced cycles in triangle graphs.
Discrete Applied Mathematics, 2016

Computing all possible graph structures describing linearly conjugate realizations of kinetic systems.
Computer Physics Communications, 2016

Dominating Sequences in Grid-Like and Toroidal Graphs.
Electr. J. Comb., 2016

When the vertex coloring of a graph is an edge coloring of its line graph - a rare coincidence.
Ars Comb., 2016

Tropical Dominating Sets in Vertex-Coloured Graphs.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Safe Sets in Graphs: Graph Classes and Structural Parameters.
Proceedings of the Combinatorial Optimization and Applications, 2016

Offline black and white bin packing.
Theor. Comput. Sci., 2015

Online Results for Black and White Bin Packing.
Theory Comput. Syst., 2015

Induced Decompositions of Highly Dense Graphs.
Journal of Graph Theory, 2015

Orientations of Graphs with Prescribed Weighted Out-Degrees.
Graphs and Combinatorics, 2015

An application of Combinatorics in Cryptography.
Electronic Notes in Discrete Mathematics, 2015

Maximum uniformly resolvable decompositions of Kv and Kv-I into 3-stars and 3-cycles.
Discrete Mathematics, 2015

Distance-constrained labeling of complete trees.
Discrete Mathematics, 2015

Approximability of the upper chromatic number of hypergraphs.
Discrete Mathematics, 2015

Minimum order of graphs with given coloring parameters.
Discrete Mathematics, 2015

Speeding up deciphering by hypergraph ordering.
Des. Codes Cryptography, 2015

Minimum number of affine simplices of given dimension.
Discrete Applied Mathematics, 2015

Turán numbers and batch codes.
Discrete Applied Mathematics, 2015

Generalized Line Graphs: Cartesian Products and Complexity of Recognition.
Electr. J. Comb., 2015

Maximum number of colors in hypertrees of bounded degree.
CEJOR, 2015

Circular coloring of graphs via linear programming and tabu search.
CEJOR, 2015

Bin Packing Game with an Interest Matrix.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

Complexity and approximation for Traveling Salesman Problems with profits.
Theor. Comput. Sci., 2014

Uniformly resolvable decompositions of Kv into P3 and K3 graphs.
Discrete Mathematics, 2014

Total Transversals and Total Domination in Uniform Hypergraphs.
Electr. J. Comb., 2014

G-designs without blocking sets, Note.
Ars Comb., 2014

Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9.
Theor. Comput. Sci., 2013

Dense subgraph mining with a mixed graph model.
Pattern Recognition Letters, 2013

Colorability of mixed hypergraphs and their chromatic inversions.
J. Comb. Optim., 2013

Bin packing with "Largest In Bottom" constraint: tighter bounds and generalizations.
J. Comb. Optim., 2013

$$[1, 1, t]$$ -Colorings of Complete Graphs.
Graphs and Combinatorics, 2013

Choice-perfect graphs.
Discussiones Mathematicae Graph Theory, 2013

Decompositions of plane graphs under parity constrains given by faces.
Discussiones Mathematicae Graph Theory, 2013

Problems on cycles and colorings.
Discrete Mathematics, 2013

Color the cycles.
Discrete Mathematics, 2013

Cordial labeling of hypertrees.
Discrete Mathematics, 2013

Color-bounded hypergraphs, VI: Structural and functional jumps in complexity.
Discrete Mathematics, 2013

Equality of domination and transversal numbers in hypergraphs.
Discrete Applied Mathematics, 2013

Bin covering with a general profit function: approximability results.
CEJOR, 2013

Matching Matchings.
Proceedings of the 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems, 2013

List Colorings of K5-Minor-Free Graphs With Special List Assignments.
Journal of Graph Theory, 2012

Small Edge Sets Meeting all Triangles of a Graph.
Graphs and Combinatorics, 2012

Transversals and domination in uniform hypergraphs.
Eur. J. Comb., 2012

Vertex coloring without large polychromatic stars.
Discrete Mathematics, 2012

3-consecutive edge coloring of a graph.
Discrete Mathematics, 2012

Proper connection of graphs.
Discrete Mathematics, 2012

Distance domination versus iterated domination.
Discrete Mathematics, 2012

Black and White Bin Packing.
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Complexity and approximation of the Constrained Forest problem.
Theor. Comput. Sci., 2011

Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling.
J. Comb. Optim., 2011

The Graph-Bin Packing Problem.
Int. J. Found. Comput. Sci., 2011

Combinatorial batch codes: Extremal problems under Hall-type conditions.
Electronic Notes in Discrete Mathematics, 2011

Optimal guard sets and the Helly property.
Eur. J. Comb., 2011

Color-bounded hypergraphs, V: host graphs and subdivisions.
Discussiones Mathematicae Graph Theory, 2011

Improper C-colorings of graphs.
Discrete Applied Mathematics, 2011

The most vital nodes with respect to independent set and vertex cover.
Discrete Applied Mathematics, 2011

Optimal batch codes: Many items or low retrieval requirement.
Adv. in Math. of Comm., 2011

Graph based Solution for Segmentation Tasks in Case of Out-of-focus, Noisy and Corrupted Images.
Proceedings of the IMAGAPP & IVAPP 2011, 2011

Geometric representation for semi on-line scheduling on uniform processors.
Optimization Methods and Software, 2010

C-perfect hypergraphs.
Journal of Graph Theory, 2010

Satisfactory graph partition, variants, and generalizations.
European Journal of Operational Research, 2010

3-consecutive C-colorings of graphs.
Discussiones Mathematicae Graph Theory, 2010

Hall number for list colorings of graphs: Extremal results.
Discrete Mathematics, 2010

Approximation algorithms for the minimum rainbow subgraph problem.
Discrete Mathematics, 2010

Color-bounded hypergraphs, IV: Stable colorings of hypertrees.
Discrete Mathematics, 2010

Infinite versus finite graph domination.
Discrete Mathematics, 2010

Voloshin's conjecture for C-perfect hypertrees.
Australasian J. Combinatorics, 2010

Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Bin Packing/Covering with Delivery, solved with the evolution of algorithms.
Proceedings of the Fifth International Conference on Bio-Inspired Computing: Theories and Applications, 2010

Groupies in random graphs.
Inf. Process. Lett., 2009

Learning of winning strategies for terminal games with linear-size memory.
Int. J. Game Theory, 2009

Smallest Set-Transversals of k-Partitions.
Graphs and Combinatorics, 2009

Clique-transversal sets and weak 2-colorings in graphs of small maximum degree.
Discrete Mathematics & Theoretical Computer Science, 2009

On list critical graphs.
Discrete Mathematics, 2009

Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees.
Discrete Mathematics, 2009

Color-bounded hypergraphs, I: General results.
Discrete Mathematics, 2009

Some complexity problems on single input double output controllers.
Discrete Applied Mathematics, 2009

Logartihmic upper bound for the upper chromatic number of S(t, t+1, v) systems.
Ars Comb., 2009

Covering a Graph with a Constrained Forest (Extended Abstract).
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Semi-online scheduling on two uniform processors.
Theor. Comput. Sci., 2008

Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs.
SIAM J. Discrete Math., 2008

Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3.
J. Discrete Algorithms, 2008

Approximation of satisfactory bisection problems.
J. Comput. Syst. Sci., 2008

Uniform Mixed Hypergraphs: The Possible Numbers of Colors.
Graphs and Combinatorics, 2008

On Rainbow Connection.
Electr. J. Comb., 2008

Extremal jumps of the Hall number.
Electronic Notes in Discrete Mathematics, 2007

Characterization of graphs dominated by induced paths.
Discrete Mathematics, 2007

On-line arbitrarily vertex decomposable trees.
Discrete Applied Mathematics, 2007

Orderings of uniquely colorable hypergraphs.
Discrete Applied Mathematics, 2007

Efficient algorithms for decomposing graphs under degree constraints.
Discrete Applied Mathematics, 2007

Game List Colouring of Graphs.
Electr. J. Comb., 2007

Lower bound on the profile of degree pairs in cross-intersecting set systems.
Combinatorica, 2007

Degree-constrained decompositions of graphs: Bounded treewidth and planarity.
Theor. Comput. Sci., 2006

Largest Non-Unique Subgraphs.
Graphs and Combinatorics, 2006

Mixed colorings of hypergraphs.
Electronic Notes in Discrete Mathematics, 2006

New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks.
Discrete Mathematics & Theoretical Computer Science, 2006

The cost chromatic number and hypergraph parameters.
Discussiones Mathematicae Graph Theory, 2006

The satisfactory partition problem.
Discrete Applied Mathematics, 2006

List version of L(d, s)-labelings.
Theor. Comput. Sci., 2005

Highly connected counterexamples to a conjecture on ά -domination.
Discussiones Mathematicae Graph Theory, 2005

Graph Domination in Distance Two.
Discussiones Mathematicae Graph Theory, 2005

Dominating Bipartite Subgraphs in Graphs.
Discussiones Mathematicae Graph Theory, 2005

The cover pebbling number of graphs.
Discrete Mathematics, 2005

Strong branchwidth and local transversals.
Discrete Applied Mathematics, 2005

Complexity and Approximation of Satisfactory Partition Problems.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks.
J. Scheduling, 2004

Partition of C 4-Designs into Minimum and Maximum Number of P 3-Designs.
Graphs and Combinatorics, 2004

Graphs without induced P5 and C5.
Discussiones Mathematicae Graph Theory, 2004

On short cycles through prescribed vertices of a graph.
Discrete Mathematics, 2004

Scheduling groups of tasks with precedence constraints on three dedicated processors.
Discrete Applied Mathematics, 2004

The effect of model simplification assumptions on the differential index of lumped process models.
Computers & Chemical Engineering, 2004

Marking Games and the Oriented Game Chromatic Number of Partial k-Trees.
Graphs and Combinatorics, 2003

Strict colorings of Steiner triple and quadruple systems: a survey.
Discrete Mathematics, 2003

Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types.
The Computer Science Journal of Moldova, 2003

Schütte's Tournament Problem and Intersecting Families of Sets.
Combinatorics, Probability & Computing, 2003

Local Anti-Ramsey Numbers of Graphs.
Combinatorics, Probability & Computing, 2003

Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items.
Algorithmica, 2003

Unique colorings of bi-hypergraphs.
Australasian J. Combinatorics, 2003

On the Existence and Determination of Satisfactory Partitions in a Graph.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Distance Graphs with Finite Chromatic Number.
J. Comb. Theory, Ser. B, 2002

On the complexity of bicoloring clique hypergraphs of graphs.
J. Algorithms, 2002

The Chromatic Spectrum of Mixed Hypergraphs.
Graphs and Combinatorics, 2002

Domination in partitioned graphs.
Discussiones Mathematicae Graph Theory, 2002

Uniquely colorable mixed hypergraphs.
Discrete Mathematics, 2002

A note on planar 5-list colouring: non-extendability at distance 4.
Discrete Mathematics, 2002

Structural domination of graphs.
Ars Comb., 2002

On the b-Chromatic Number of Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Ramsey numbers for tournaments.
Theor. Comput. Sci., 2001

Oriented list colorings of graphs.
Journal of Graph Theory, 2001

Minimally Non-Preperfect Graphs of Small Maximum Degree.
Graphs and Combinatorics, 2001

Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs.
Discrete Mathematics, 2001

Heredity properties of connectedness in edge-coloured complete graphs.
Discrete Mathematics, 2001

Complexity of Coloring Graphs without Forbidden Induced Subgraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

Sharpness of Some Intersection Theorems.
Eur. J. Comb., 2000

Extremal bi-Helly families.
Discrete Mathematics, 2000

On-line rankings of graphs.
Discrete Mathematics, 2000

Uncolorable Mixed Hypergraphs.
Discrete Applied Mathematics, 2000

On the complexity of bicoloring clique hypergraphs of graphs (extended abstract).
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors.
Parallel Computing, 1999

On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs.
J. Algorithms, 1999

Chromatic spectrum is broken.
Electronic Notes in Discrete Mathematics, 1999

Remarks on the existence of uniquely partitionable planar graphs.
Discussiones Mathematicae Graph Theory, 1999

Disjoint blocking sets in cycle systems.
Discrete Mathematics, 1999

On light cycles in plane triangulations.
Discrete Mathematics, 1999

Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdös inequality.
Discrete Mathematics, 1999

On-line approximation algorithms for scheduling tasks on identical machines withextendable working time.
Annals OR, 1999

Rankings of Graphs.
SIAM J. Discrete Math., 1998

Brooks-type theorems for choosability with separation.
Journal of Graph Theory, 1998

A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins.
Inf. Process. Lett., 1998

Strict colourings for classes of steiner triple systems.
Discrete Mathematics, 1998

Complexity of choosing subsets from color sets.
Discrete Mathematics, 1998

Rankings of Directed Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract).
Proceedings of the STACS 98, 1998

Efficient Approximation Algorithms for the Subset-Sums Equality Problem.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Semi on-line algorithms for the partition problem.
Oper. Res. Lett., 1997

Graph colorings with local constraints - a survey.
Discussiones Mathematicae Graph Theory, 1997

Generalized colorings and avoidable orientations.
Discussiones Mathematicae Graph Theory, 1997

Upper chromatic number of Steiner triple and quadruple systems.
Discrete Mathematics, 1997

The color cost of a caterpillar.
Discrete Mathematics, 1997

Efficiency and effectiveness of normal schedules on three dedicated processors.
Discrete Mathematics, 1997

Choosability and fractional chromatic numbers.
Discrete Mathematics, 1997

List Colorings and Reducibility.
Discrete Applied Mathematics, 1997

Comparability Graph Augmentation for some Multiprocessor Scheduling Problems.
Discrete Applied Mathematics, 1997

Switching Distance Graphs.
Ars Comb., 1997

New trends in the theory of graph colorings: Choosability and list coloring.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

Optimal routings in communication networks with linearly bounded forwarding index.
Networks, 1996

Every 2-choosable graph is (2m, m)-choosable.
Journal of Graph Theory, 1996

Cycles of given color patterns.
Journal of Graph Theory, 1996

Minimal colorings for properly colored subgraphs.
Graphs and Combinatorics, 1996

Eur. J. Comb., 1996

The irregularity strength and cost of the union of cliques.
Discrete Mathematics, 1996

Covering and independence in triangle structures.
Discrete Mathematics, 1996

Hamiltonian properties of Toeplitz graphs.
Discrete Mathematics, 1996

Cycle-saturated graphs of minimum size.
Discrete Mathematics, 1996

The Forwarding Index of Directed Networks.
Discrete Applied Mathematics, 1996

Precoloring Extension 3: Classes of Perfect Graphs.
Combinatorics, Probability & Computing, 1996

How to Make A Random Graph Irregular.
Random Struct. Algorithms, 1995

The Acyclic Orientation Game on Random Graphs.
Random Struct. Algorithms, 1995

Degree Sums and Covering Cycles.
Journal of Graph Theory, 1995

Stronger bounds for generalized degress and Menger path systems.
Discussiones Mathematicae Graph Theory, 1995

4-chromatic graphs with large odd girth.
Discrete Mathematics, 1995

Searching for acyclic orientations of graphs.
Discrete Mathematics, 1995

Bipartite Subgraphs of Triangle-Free Graphs.
SIAM J. Discrete Math., 1994

The expected relative error of the polyhedral approximation of the max-cut problem.
Oper. Res. Lett., 1994

Local and global average degree in graphs and multigraphs.
Journal of Graph Theory, 1994

Intersection Dimensions of Graph Classes.
Graphs and Combinatorics, 1994

Largest size and union of Helly families.
Discrete Mathematics, 1994

Monochromatic coverings and tree Ramsey numbers.
Discrete Mathematics, 1994

Characterization of (m, 1)-transitive and (3, 2)-transitive semi-complete directed graphs.
Discrete Mathematics, 1994

The spectrum of lambda-times repeated blocks for TS(upsilon, lambda).
Discrete Mathematics, 1994

On conjectures of Berge and Chvátal.
Discrete Mathematics, 1994

Inequalities for Minimal Covering Sets in Set Systems of Given Rank.
Discrete Applied Mathematics, 1994

Algorithmic complexity of list colorings.
Discrete Applied Mathematics, 1994

Packing Problems in Edge-colored Graphs.
Discrete Applied Mathematics, 1994

Blocking Sets in SQS(2u).
Combinatorics, Probability & Computing, 1994

Ranking of Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

The Number of Maximal Independent Sets in Triangle-Free Graphs.
SIAM J. Discrete Math., 1993

Algorithmic Aspects of Neighborhood Numbers.
SIAM J. Discrete Math., 1993

One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete.
SIAM J. Comput., 1993

An upper bound on the number of cliques in a graph.
Networks, 1993

Helly Property in Finite Set Systems.
J. Comb. Theory, Ser. A, 1993

Multipartite Turán problem for connected graphs and hypergraphs.
Discrete Mathematics, 1993

Menger-type theorems with restrictions on path lengths.
Discrete Mathematics, 1993

Large s-representable set systems with low maximum degree.
Discrete Mathematics, 1993

Bounded degrees and prescribed distances in graphs.
Discrete Mathematics, 1993

Graphs with no induced C4 and 2K2.
Discrete Mathematics, 1993

Domination properties and induced subgraphs.
Discrete Mathematics, 1993

Linear-Time Algorithms for the Max Cut Problem.
Combinatorics, Probability & Computing, 1993

Maximum cuts and largest bipartite subgraphs.
Proceedings of the Combinatorial Optimization, 1993

Rainbow Subgraphs in Properly Edge-colored Graphs.
Random Struct. Algorithms, 1992

Nearly uniform distribution of edges among k-subgraphs of a graph.
Journal of Graph Theory, 1992

Graph coloring in linear time.
J. Comb. Theory, Ser. B, 1992

Asymptotic growth of sparse saturated structures is locally determined.
Discrete Mathematics, 1992

Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets.
Discrete Mathematics, 1992

Covering the cliques of a graph with vertices.
Discrete Mathematics, 1992

Precoloring extension. I. Interval graphs.
Discrete Mathematics, 1992

Narrowness, pathwidth, and their application in natural language processing.
Discrete Applied Mathematics, 1992

Perfect couples of graphs.
Combinatorica, 1992

A Periodic Division Pattern that Cannot be Generated by D0L Systems.
Theor. Comput. Sci., 1991

Improved lower bounds on k-independence.
Journal of Graph Theory, 1991

Extensions of Gallai's graph covering theorems for uniform hypergraphs.
J. Comb. Theory, Ser. B, 1991

Local constraints ensuring small representing sets.
J. Comb. Theory, Ser. A, 1991

Hypergraph coverings and local colorings.
J. Comb. Theory, Ser. B, 1991

Perfect graph decompositions.
Graphs and Combinatorics, 1991

Asymptotic results on saturated graphs.
Discrete Mathematics, 1991

Decompositions of regular bipartite graphs.
Discrete Mathematics, 1991

Saturated r-uniform hypergraphs.
Discrete Mathematics, 1991

Clique-transversal sets of line graphs and complements of line graphs.
Discrete Mathematics, 1991

Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments.
SIAM J. Discrete Math., 1990

A characterization of graphs without long induced paths.
Journal of Graph Theory, 1990

Periodic String Division Generated by Deterministic L Systems.
Inf. Process. Lett., 1990

A conjecture on triangles of graphs.
Graphs and Combinatorics, 1990

Contractions and minimalk-colorability.
Graphs and Combinatorics, 1990

Covering all cliques of a graph.
Discrete Mathematics, 1990

The maximum number of edges in 2K2-free graphs of bounded degree.
Discrete Mathematics, 1990

Minimum number of elements representing a set system of given rank.
J. Comb. Theory, Ser. A, 1989

On the maximum number of qualitatively independent partitions.
J. Comb. Theory, Ser. A, 1989

Radius, diameter, and minimum degree.
J. Comb. Theory, Ser. B, 1989

Sub-Ramsey numbers for arithmetic progressions.
Graphs and Combinatorics, 1989

Induced matchings in bipartite graphs.
Discrete Mathematics, 1989

Isomorphism of two infinite-chromatic triangle-free graphs.
Discrete Mathematics, 1988

Clumsy packing of dominoes.
Discrete Mathematics, 1988

Local k-colorings of graphs and hypergraphs.
J. Comb. Theory, Ser. B, 1987

Inequalities for two set systems with prescribed intersections.
Graphs and Combinatorics, 1987

Linear upper bounds for local Ramsey numbers.
Graphs and Combinatorics, 1987

Maximum bipartite subgraphs of Kneser graphs.
Graphs and Combinatorics, 1987

Ramsey numbers for local colorings.
Graphs and Combinatorics, 1987

Another Extremal Property of Some Turan Graphs.
Eur. J. Comb., 1987

An upper bound on the Ramsey number of trees.
Discrete Mathematics, 1987

On two intersecting set systems and k-continuous boolean functions.
Discrete Applied Mathematics, 1987

On the context-free production complexity of finite languages.
Discrete Applied Mathematics, 1987

Saturated graphs with minimal number of edges.
Journal of Graph Theory, 1986

Neighborhood perfect graphs.
Discrete Mathematics, 1986

Some combinatorial problems concerning finite languages.
Proceedings of the Trends, 1986

Critical hypergraphs and intersecting set-pair systems.
J. Comb. Theory, Ser. B, 1985

On color critical graphs.
J. Comb. Theory, Ser. B, 1985

Hypergraphs without a large star.
Discrete Mathematics, 1985

How many atoms can be defined by boxes.
Combinatorica, 1985

Helly-type Hypergraphs and Sperner Families.
Eur. J. Comb., 1984

The structure of rectangle families dividing the plane into maximum number of atoms.
Discrete Mathematics, 1984

Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices.
Combinatorica, 1984

Triangle-free partial graphs and edge covering theorems.
Discrete Mathematics, 1982

Ensembles d'articulation d'un graphe γ-critique.
Discrete Mathematics, 1980

Induced subtrees in graphs of large chromatic number.
Discrete Mathematics, 1980