The following pages link to Zsolt Tuza (Q175498):
Displaying 23 items.
- Perfect Triangle Families (Q4835697) (← links)
- Degree Sums and Covering Cycles (Q4857441) (← links)
- Stronger bounds for generalized degress and Menger path systems (Q4882589) (← links)
- The equal–sum–free subset problem (Q4969019) (← links)
- Complex uniformly resolvable decompositions of K_v (Q5013340) (← links)
- Algorithms and Computation (Q5191672) (← links)
- Mixed hypergraphs and beyond (Q5198021) (← links)
- Singular Ramsey and Turán numbers (Q5225554) (← links)
- Safe sets, network majority on weighted trees (Q5228508) (← links)
- An upper bound on the number of cliques in a graph (Q5287454) (← links)
- Dominating Bipartite Subgraphs in Graphs (Q5316262) (← links)
- Graph Domination in Distance Two (Q5316266) (← links)
- The cost chromatic number and hypergraph parameters (Q5437220) (← links)
- Highly connected counterexamples to a conjecture on α -domination (Q5492656) (← links)
- Realization of digraphs in Abelian groups and its consequences (Q6081565) (← links)
- The <i>k</i>‐path vertex cover: General bounds and chordal graphs (Q6087563) (← links)
- The bin covering with delivery problem, extended investigations for the online case (Q6100671) (← links)
- Connected domination in random graphs (Q6107484) (← links)
- Spectrum of 3-uniform 6- and 9-cycle systems over \(K_v^{( 3 )} - I\) (Q6136666) (← links)
- The board packing problem (Q6167668) (← links)
- Vector sum-intersection theorems (Q6172276) (← links)
- Some exact results for regular Turán problems for all large orders (Q6181995) (← links)
- Extremal graph theoretic questions for q-ary vectors (Q6435135) (← links)
