Approximability of the upper chromatic number of hypergraphs

Aspects of upper defensive alliances

Bounds on the game transversal number in hypergraphs

C-perfect hypergraphs

Color-bounded hypergraphs, I: General results

article by Csilla Bujtás et al published August 2009 in Discrete Mathematics

Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees

article by Csilla Bujtás & Zsolt Tuza published November 2009 in Discrete Mathematics

Color-bounded hypergraphs, IV: Stable colorings of hypertrees

article by Csilla Bujtás & Zsolt Tuza published May 2010 in Discrete Mathematics

Color-bounded hypergraphs, VI: Structural and functional jumps in complexity

article by Csilla Bujtás & Zsolt Tuza published October 2013 in Discrete Mathematics

Combinatorial batch codes: Extremal problems under Hall-type conditions

Covering and independence in triangle structures

Covering the cliques of a graph with vertices

scientific article published in October 1992

Disjoint Paired-Dominating sets in Cubic Graphs

scientific article published on 15 July 2019

Equality of domination and transversal numbers in hypergraphs

Extended Bicolorings of Steiner Triple Systems of Order $2^{h}-1$

F-WORM colorings: Results for2-connected graphs

Grundy dominating sequences and zero forcing sets

Hypergraph colouring

Improper C-colorings of graphs

Induced cycles in triangle graphs

K_3-WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum

Maximum number of colors in hypertrees of bounded degree

Maximum number of colors: C-coloring and related problems

article published in 2011

Mixed colorings of hypergraphs

On list critical graphs

Optimal Multi-TDMA Scheduling in Ring Topology Networks

Optimal batch codes: Many items or low retrieval requirement

Orderings of uniquely colorable hypergraphs

Partition-Crossing Hypergraphs

Radius, diameter, and minimum degree

article published in 1989

Rainbow subgraphs in properly edge-colored graphs ⬇️

scholarly article from 'Random Structures & Algorithms' published in 1992

Relaxations of Hall’s Condition: Optimal batch codes with multiple queries

Smallest Set-Transversals of k-Partitions

The Disjoint Domination Game

The minimum number of vertices in uniform hypergraphs with given domination number

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

scientific article published on 14 June 2017

Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game

Transversal designs and induced decompositions of graphs

Transversals and domination in uniform hypergraphs

Tropical Dominating Sets in Vertex-Coloured Graphs

article by Jean-Alexandre Anglès d’Auriac et al published 2016 in Lecture Notes in Computer Science

Turán numbers and batch codes

scientific paper

Uniform Mixed Hypergraphs: The Possible Numbers of Colors

Vertex coloring without large polychromatic stars