The following pages link to Zsolt Tuza (Q175498):
Displaying 50 items.
- (Q4838466) (← links)
- (Q4840774) (← links)
- Degree Sums and Covering Cycles (Q4857441) (← links)
- Cycles of given color patterns (Q4865523) (← links)
- Vertex coverings of the edge set in a connected graph (Q4871079) (← links)
- (Q4877597) (← links)
- (Q4878671) (← links)
- (Q4882474) (← links)
- Stronger bounds for generalized degress and Menger path systems (Q4882589) (← links)
- Precoloring Extension III: Classes of Perfect Graphs (Q4883061) (← links)
- (Q4888118) (← links)
- (Q4913435) (← links)
- (Q4940074) (← links)
- (Q4952596) (← links)
- The equal–sum–free subset problem (Q4969019) (← links)
- Complex uniformly resolvable decompositions of K_v (Q5013340) (← links)
- Distance Domination in Vertex Partitioned Graphs (Q5074723) (← links)
- Regular Tur\'an numbers (Q5139696) (← links)
- Algorithms and Computation (Q5191672) (← links)
- Mixed hypergraphs and beyond (Q5198021) (← links)
- Rainbow Hamiltonian paths and canonically colored subgraphs in infinite complete graphs (Q5202210) (← links)
- (Q5203068) (← links)
- Singular Ramsey and Turán numbers (Q5225554) (← links)
- Safe sets, network majority on weighted trees (Q5228508) (← links)
- (Q5248308) (← links)
- (Q5279158) (← links)
- On the Complexity of Finding a Potential Community (Q5283357) (← links)
- (Q5284571) (← links)
- Algorithmic Aspects of Neighborhood Numbers (Q5285934) (← 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)
- (Q5387663) (← links)
- Relaxations of Hall’s Condition: Optimal batch codes with multiple queries (Q5396539) (← links)
- The cost chromatic number and hypergraph parameters (Q5437220) (← links)
- (Q5445044) (← links)
- (Q5461526) (← links)
- (Q5462155) (← links)
- Highly connected counterexamples to a conjecture on α -domination (Q5492656) (← links)
- Computing and Combinatorics (Q5717006) (← links)
- (Q5750884) (← links)
- (Q5750908) (← links)
- Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs. (Q5931409) (← links)
- Heredity properties of connectedness in edge-coloured complete graphs (Q5937941) (← links)
- Ramsey numbers for tournaments (Q5941503) (← links)
- Minimally non-preperfect graphs of small maximum degree (Q5956111) (← links)
- Comparability graph augmentation for some multiprocessor scheduling problems (Q5961606) (← 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)
