The following pages link to Zoltán Szigeti (Q210158):
Displayed 50 items.
- Item:Q210158 (redirect page) (← links)
- Packing of rigid spanning subgraphs and spanning trees (Q401490) (← links)
- Edge-connectivity of permutation hypergraphs (Q442359) (← links)
- Greedy colorings of words (Q444455) (← links)
- Recent results on well-balanced orientations (Q955324) (← links)
- Edge-connectivity augmentation of graphs over symmetric parity families (Q998390) (← links)
- The two ear theorem on matching-covered graphs (Q1127879) (← links)
- Hypergraph connectivity augmentation (Q1300056) (← links)
- On packing \(T\)-cuts (Q1333344) (← links)
- On the graphic matroid parity problem (Q1400959) (← links)
- Perfect matchings versus odd cuts (Q1410409) (← links)
- On a min--max theorem on bipartite graphs (Q1422438) (← links)
- On packing spanning arborescences with matroid constraint (Q1689956) (← links)
- Old and new results on packing arborescences in directed hypergraphs (Q1744239) (← links)
- On minimally 2-\(T\)-connected directed graphs (Q1801059) (← links)
- A note on packing paths in planar graphs (Q1906072) (← links)
- On a matroid defined by ear-decompositions of graphs (Q1924493) (← links)
- The \((2, k)\)-connectivity augmentation problem: algorithmic aspects (Q2041970) (← links)
- Packing of mixed hyperarborescences with flexible roots via matroid intersection (Q2048562) (← links)
- On the complexity of finding well-balanced orientations with upper bounds on the out-degrees (Q2106523) (← links)
- Reachability in arborescence packings (Q2166224) (← links)
- On packing time-respecting arborescences (Q2172082) (← links)
- Packing of arborescences with matroid constraints via matroid intersection (Q2188242) (← links)
- Eulerian orientations and vertex-connectivity (Q2217466) (← links)
- Polymatroid-based capacitated packing of branchings (Q2334055) (← links)
- Covering symmetric semi-monotone functions (Q2462361) (← links)
- Edge-splittings preserving local edge-connectivity of graphs (Q2482096) (← links)
- Simultaneous well-balanced orientations of graphs (Q2498739) (← links)
- Connectivity of orientations of 3-edge-connected graphs (Q2662789) (← links)
- Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph (Q2706198) (← links)
- (Q2816140) (← links)
- Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph (Q2851459) (← links)
- (Q2918487) (← links)
- Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph (Q2968515) (← links)
- Edge-Connectivity Augmentations of Graphs and Hypergraphs (Q2971622) (← links)
- An Excluded Minor Characterization of Seymour Graphs (Q3009746) (← links)
- A characterization of Seymour graphs (Q3129829) (← links)
- (Q3439662) (← links)
- (Q3840349) (← links)
- (Q3840352) (← links)
- (Q4234158) (← links)
- (Q4250196) (← links)
- Edge-Connectivity Augmentation with Partition Constraints (Q4255815) (← links)
- (Q4263711) (← links)
- (Q4263728) (← links)
- Detachments Preserving Local Edge-Connectivity of Graphs (Q4443122) (← links)
- Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph (Q4916091) (← links)
- A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case (Q5096584) (← links)
- A characterization of Seymour graphs (Q5101429) (← links)
- On packing spanning arborescences with matroid constraint (Q5110654) (← links)