The following pages link to Zoltán Szigeti (Q210158):
Displaying 17 items.
- On ‐connected graphs (Q5229537) (← links)
- Matroid-Based Packing of Arborescences (Q5300512) (← links)
- (Q5417727) (← links)
- On generalizations of matching-covered graphs (Q5946644) (← links)
- An orientation theorem with parity conditions (Q5954236) (← links)
- A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case (Q6058192) (← links)
- Steiner connectivity problems in hypergraphs (Q6072212) (← links)
- The complexity of 2-vertex-connected orientation in mixed graphs (Q6108925) (← links)
- On reversing arcs to improve arc-connectivity (Q6121420) (← links)
- The $(2,k)$-connectivity augmentation problem: Algorithmic aspects (Q6338957) (← links)
- On the complexity of finding well-balanced orientations with upper bounds on the out-degrees (Q6392329) (← links)
- On packing time-respecting arborescences (Q6392596) (← links)
- Packing forests (Q6513767) (← links)
- Matroid-reachability-based decomposition into arborescences (Q6533429) (← links)
- Matroid-rooted packing of arborescences (Q6646737) (← links)
- On arborescence packing augmentation in hypergraphs (Q6756564) (← links)
- Augmenting a hypergraph to have a matroid-based $(f,g)$-bounded $(\alpha,\beta)$-limited packing of rooted hypertrees (Q6756566) (← links)
