The following pages link to Zsolt Tuza (Q175498):
Displaying 50 items.
- On Grundy total domination number in product graphs (Q2214319) (← links)
- The domination number of the graph defined by two levels of the \(n\)-cube. II (Q2225404) (← links)
- On specific factors in graphs (Q2227979) (← links)
- A conjecture on triangles of graphs (Q2276982) (← links)
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum (Q2323435) (← links)
- Fractional domination game (Q2327216) (← links)
- Disjoint paired-dominating sets in cubic graphs (Q2334075) (← links)
- Speeding up deciphering by hypergraph ordering (Q2339143) (← links)
- Distance-constrained labeling of complete trees (Q2342628) (← links)
- Online results for black and white bin packing (Q2344213) (← links)
- Turán numbers and batch codes (Q2345596) (← links)
- Maximum uniformly resolvable decompositions of \(K_v\) and \(K_v - I\) into 3-stars and 3-cycles (Q2346328) (← links)
- Approximability of the upper chromatic number of hypergraphs (Q2346334) (← links)
- Offline black and white bin packing (Q2355707) (← links)
- Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007) (← links)
- Coloring the cliques of line graphs (Q2401798) (← links)
- The minimum number of vertices in uniform hypergraphs with given domination number (Q2401806) (← links)
- A combinatorial problem related to sparse systems of equations (Q2402975) (← links)
- \(F\)-WORM colorings: results for 2-connected graphs (Q2403800) (← links)
- Tropical matchings in vertex-colored graphs (Q2413176) (← links)
- Using weight decision for decreasing the price of anarchy in selfish bin packing games (Q2424774) (← links)
- Equality of domination and transversal numbers in hypergraphs (Q2446829) (← links)
- Lower bound on the profile of degree pairs in cross-intersecting set systems (Q2460634) (← links)
- The on-line multiprocessor scheduling problem with known sum of the tasks (Q2464434) (← links)
- Semi-online scheduling on two uniform processors (Q2481966) (← links)
- Uniform mixed hypergraphs: the possible numbers of colors (Q2482347) (← links)
- The cover pebbling number of graphs (Q2484366) (← links)
- The satisfactory partition problem (Q2495904) (← links)
- Minimal colorings for properly colored subgraphs (Q2563425) (← links)
- New models of graph-bin packing (Q2629236) (← links)
- Erratum volume 50, number 2 (1990): Peter Horák, ``A coloring problem related to the Erdős-Faber-Lovász conjecture,'' pp. 321-322 (Q2641313) (← links)
- Oriented list colorings of graphs (Q2725322) (← links)
- Chromatic spectrum is broken (Q2741343) (← links)
- Transversal game on hypergraphs and the \(\frac{3}{4}\)-conjecture on the total domination game (Q2821619) (← links)
- Hypergraph colouring (Q2822598) (← links)
- Colouring games (Q2822601) (← links)
- When the vertex coloring of a graph is an edge coloring of its line graph -- a rare coincidence. (Q2829074) (← links)
- Black and White Bin Packing (Q2848920) (← links)
- Decompositions of plane graphs under parity constrains given by faces (Q2857028) (← links)
- Combinatorial batch codes: extremal problems under Hall-type conditions (Q2857344) (← links)
- Choice-perfect graphs (Q2866464) (← links)
- List colorings of \(K_5\)-minor-free graphs with special list assignments (Q2911050) (← links)
- Induced Decompositions of Highly Dense Graphs (Q2940990) (← links)
- Safe Sets in Graphs: Graph Classes and Structural Parameters (Q2958317) (← links)
- Asymptotically optimal induced decompositions (Q2969174) (← links)
- 3-consecutive C-colorings of graphs (Q2997600) (← links)
- Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures (Q3000504) (← links)
- (Q3001210) (← links)
- (Q3011760) (← links)
- (Q3012388) (← links)
