The following pages link to Zsolt Tuza (Q175498):
Displaying 50 items.
- The disjoint domination game (Q279227) (← links)
- Transversal designs and induced decompositions of graphs (Q286751) (← links)
- A 13/12 approximation algorithm for bin packing with extendable bins (Q293250) (← links)
- Induced cycles in triangle graphs (Q298987) (← links)
- Bin covering with a general profit function: approximability results (Q301139) (← links)
- Circular coloring of graphs via linear programming and tabu search (Q302132) (← links)
- Maximum number of colors in hypertrees of bounded degree (Q302137) (← links)
- An application of combinatorics in cryptography (Q322183) (← links)
- Bounds on the game transversal number in hypergraphs (Q326647) (← links)
- \([1,1,t]\)-colorings of complete graphs (Q354429) (← links)
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity (Q383764) (← links)
- Problems on cycles and colorings (Q383772) (← links)
- Color the cycles (Q383778) (← links)
- Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations (Q385496) (← links)
- Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\) (Q392175) (← links)
- Cordial labeling of hypertrees (Q393911) (← links)
- Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs (Q397162) (← links)
- Total transversals and total domination in uniform hypergraphs (Q405218) (← links)
- Maximum number of colors: C-coloring and related problems (Q408951) (← links)
- The most vital nodes with respect to independent set and vertex cover (Q411833) (← links)
- Vertex coloring without large polychromatic stars (Q432703) (← links)
- Proper connection of graphs (Q442366) (← links)
- Distance domination versus iterated domination (Q442389) (← links)
- Minimum number of affine simplices of given dimension (Q476315) (← links)
- Minimum order of graphs with given coloring parameters (Q488290) (← links)
- Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
- Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling (Q491212) (← links)
- Some properties of vertex-oblique graphs (Q501033) (← links)
- Dominating sequences in grid-like and toroidal graphs (Q504964) (← links)
- Network majority on tree topological network (Q510545) (← links)
- Learning of winning strategies for terminal games with linear-size memory (Q532661) (← links)
- Complexity and approximation of the constrained forest problem (Q553340) (← links)
- Sub-Ramsey numbers of arithmetic progressions (Q582303) (← links)
- Optimal guard sets and the Helly property (Q607361) (← links)
- Improper C-colorings of graphs (Q629357) (← links)
- Optimal batch codes: many items or low retrieval requirement (Q644328) (← links)
- Transversals and domination in uniform hypergraphs (Q649007) (← links)
- 3-consecutive edge coloring of a graph (Q658096) (← links)
- Domination properties and induced subgraphs (Q686437) (← links)
- Bounded degrees and prescribed distances in graphs (Q686447) (← links)
- Menger-type theorems with restrictions on path lengths (Q687118) (← links)
- Partition of \(C_4\)-designs into minimum and maximum number of \(P_3\)-designs (Q704856) (← links)
- Approximation algorithms for the minimum rainbow subgraph problem (Q709311) (← links)
- \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum (Q726653) (← links)
- Independent \((k + 1)\)-domination in \(k\)-trees (Q777366) (← links)
- (Q794669) (redirect page) (← links)
- Helly-type hypergraphs and Sperner families (Q794670) (← links)
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices (Q802577) (← links)
- A periodic division pattern that cannot be generated by D0L systems (Q804298) (← links)
- Local constraints ensuring small representing sets (Q804606) (← links)
